Organizations must plan how to get their commodities from production centers to consumers' homes with the least amount of transportation expense to maximize profit. The Transportation Problem (TP) approach is used to evaluate and reduce the cost of transportation. There are two types of TPs. Such as cost minimization TP and profit maximization TP. Typically, the transportation technique is employed for minimization but the objective function should be maximized rather than minimized in several categories of TPs. By changing the maximizing problem into the minimization problem, these types of issues may be resolved in literature. By deducting the unit costs from the table's greatest unit cost, maximizing is changed into minimization. The first step in achieving an optimal solution is to find the initial basic feasible solution (IBFS). North-West Conner, Least Cost, and Vogel’s Approximation Methods can be used to find IBFS. The optimal solution can be obtained by using only Modified Distribution (MODI) and Stepping Stone Methods. This study proposes a novel direct method to find an optimal or near-optimal solution to profit maximization TPs. In this proposed method, maximization TP is not needed to convert minimization TP. This method is very easy and it has less implementation. In the end, by solving several illustrative examples, we compare the proposed method’s results with other existing methods.
| Published in | American Journal of Mathematical and Computer Modelling (Volume 8, Issue 2) |
| DOI | 10.11648/j.ajmcm.20230802.11 |
| Page(s) | 17-24 |
| Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
| Copyright |
Copyright © The Author(s), 2023. Published by Science Publishing Group |
Cost Minimization, Profit Maximization, Unit Cost, Optimal Solution, Transportation Problem
| [1] | Abdelbasset, W. K., & Elsayed, S. H. (2022). Study on cross-border fresh order and transport model based on profit maximization principle. Food Science and Technology (Brazil), 42, 1–7. https://doi.org/10.1590/fst.75821 |
| [2] | Ackora-Prah, J., Acheson, V., Barnes, B., Takyi, I., & Owusu-Ansah, E. (2022). A Two-Phase Method for Solving Transportation Models with Prohibited Routes. Pakistan Journal of Statistics and Operation Research, 18(3), 749–758. https://doi.org/10.18187/pjsor.v18i3.3911 |
| [3] | Ahmed, M. M., Khan, A. R., Ahmed, F., & Uddin, M. S. (2016). Incessant Allocation Method for Solving Transportation Problems. American Journal of Operations Research, 06(03), 236–244. https://doi.org/10.4236/AJOR.2016.63024 |
| [4] | Ekanayake, E. M. D. B., & Ekanayake, E. M. U. S. B. (2022). Performance of The Best Solution for The Prohibited Route Transportation Problem by An Improved Vogel’s Approximation Method. 3(3), 190–206. https://doi.org/10.30997/ijar.v3i3.241 |
| [5] | Ekanayake, E. M. U. S. B., Perera, S. P. C., Daundasekara W. B., & Juman, Z. A. M. S., (2021). An Effective Alternative New Approach in Solving Transportation Problems. American Journal of Electrical and Computer Engineering, 5(1), 1. https://doi.org/10.11648/j.ajece.20210501.11 |
| [6] | Ekanayake, E. M. U. S. B. (2022). A Novel Approach Algorithm for Determining the Initial Basic Feasible Solution for Transportation Problems. 234–246. https://doi.org/10.47540/ijias.v2i3.529 |
| [7] | Ekanayake, E. M. U. S. B. (2022). An Improved Ant Colony Algorithm to Solve Prohibited Transportation Problems. International Journal of Applied Mathematics and Theoretical Physics., 8(2), 43. https://doi.org/10.11648/J.IJAMTP.20220802.12 |
| [8] | Ekanayake, E. M. U. S. B., Daundasekara, W. B., & Perera, S. P. C. (2021). Solution of a Transportation Problem using Bipartite Graph. Global Journals, 21(October). |
| [9] | Ekanayake, E. M. U. S. B., Daundasekara, W. B., & Perera, S. P. C. (2022). New Approach to Obtain the Maximum Flow in a Network and Optimal Solution for the Transportation Problems. Modern Applied Science, 16(1), 30. https://doi.org/10.5539/mas.v16n1p30 |
| [10] | Ekanayake, E. M. U. S. B., Perera, S. P. C., Daundasekara, W. B., & Juman, Z. A. M. S. (2020). A Modified Ant Colony Optimization Algorithm for Solving a Transportation Problem. Journal of Advances in Mathematics and Computer Science, August, 83–101. https://doi.org/10.9734/jamcs/2020/v35i530284 |
| [11] | Ekanayake, E. M. U. S. B., Daundasekara, W. B., & Perera, S. P. C. (2022). An Examination of Different Types of Transportation Problems and Mathematical Models. American Journal of Mathematical and Computer Modelling. Vol. 7, No. 3, pp. 37-48. doi: 10.11648/j.ajmcm.20220703.11. |
| [12] | Giri, P. K., Maiti, M. K., & Maiti, M. (2016). Profit maximization solid transportation problem under budget constraint using fuzzy measures. Iranian Journal of Fuzzy Systems, 13(5), 35–63. |
| [13] | Hitchcock, F. L. (1941). The Distribution of a Product from Several Sources to Numerous Localities. Journal of Mathematics and Physics, 20(1–4), 224–230. https://doi.org/10.1002/SAPM1941201224 |
| [14] | Jana, S., Das, B., Panigrahi, G., & Maiti, M. (2018). Profit Maximization Solid Transportation Problem with Gaussian Type-2 Fuzzy Environments. Annals of Pure and Applied Mathematics, 16(2), 323–335. https://doi.org/10.22457/apam.v16n2a9 |
| [15] | Juman, Z. A. M. S., Mostafa, S. A., Batuwita, A. P., Alarjani, A., Uddin, M. S., Jaber, M. M., Alam, T., & Attia, E. A. (2022). Close Interval Approximation of Pentagonal Fuzzy Numbers for Interval Data-Based Transportation Problems. Sustainability (Switzerland), 14(12). https://doi.org/10.3390/su14127423 |
| [16] | Juman, Z. A. M. S., & Nawarathne, N. G. S. A. (2019). An efficient alternative approach to solve a transportation problem. Ceylon Journal of Science, 48(1), 19. https://doi.org/10.4038/cjs.v48i1.7584 |
| [17] | Kader, M. S. F., & Alam, H. (2019). Use of a New Transportation Algorithm for Profit Maximization. European Scientific Journal ESJ, 15(15), 262–267. https://doi.org/10.19044/esj.2019.v15n15p262 |
| [18] | Kadhim, H. J., Mushtak Shiker, A. K., & Al-Dallal, H. A. H. (2021). New Technique for Finding the Maximization to Transportation Problems. Journal of Physics: Conference Series, 1963(1). https://doi.org/10.1088/1742-6596/1963/1/012070 |
| [19] | Kalam Azad, A. (2018). An Innovative Algorithmic Approach for Solving Profit Maximization Problems. Mathematics Letters, 4(1), 1. https://doi.org/10.11648/j.ml.20180401.11 |
| [20] | Korukoğlu, S., & Ballı, S. (2011). An Improved Vogel’s Approximation Method for The Transportation Problem. Mathematical and Computational Applications, 16(2), 370–381. |
| [21] | Krishna Prabha, S., & Vimala, S. (2016). A modified method for solving a balanced fuzzy transportation problem for maximizing profit. International Journal of Pure and Applied Mathematics, 106(5), 45–52. https://doi.org/10.12732/ijpam.v106i5.5 |
| [22] | Kumar, D. S., & Robinson, G. C. (2018). Profit Maximization of Balanced Fuzzy Transportation Problem Using Ranking Method. Journal of Computer and Mathematical Sciences, 9(7), 722–726. https://doi.org/10.29055/jcms/810 |
| [23] | Niluminda, K. P. O., & Ekanayake, E. M. U. S. B. (2022). An Approach for Solving Minimum Spanning Tree Problem Using a Modified Ant Colony Optimization Algorithm. American Journal of Applied Mathematics. Vol. 10, No. 6, pp. 223-235. doi: 10.11648/j.ajam.20221006.11 |
| [24] | Niluminda, K. P. O., & Ekanayake, E. M. U. S. B. (2022). An efficient method to solve minimum spanning tree problem using graph theory and improved ant colony optimization algorithm. North American Academic Research, 5(12), 34-43. doi: https://doi.org/10.5281/zenodo.7459058 |
| [25] | Niluminda, K. P. O., & Ekanayake, E. M. U. S. B. (2022). Innovative Matrix Algorithm to Address the Minimal Cost-Spanning Tree Problem. J Electrical Electron Eng, 1(1), 148-153. |
| [26] | Niluminda, K. P. O., & Ekanayake, E. M. U. S. B. (2022). Kruskal’s algorithm for solving the both balanced unbalanced acceptable and prohibited route transportation problems. North American Academic Research, 5(12), 17-33. doi: https://doi.org/10.5281/zenodo.7457110 |
| [27] | Niluminda, K. P. O., & Ekanayake, E. M. U. S. B. (2022). Novel approach based on the weight adjacency matrix to obtain the minimum weight spanning tree. 2022. |
| [28] | Niluminda, K. P. O., & Ekanayake, E. M. U. S. B. (2023). The Multi-Objective Transportation Problem Solve with Geometric Mean and Penalty Methods. Indonesian Journal of Innovation and Applied Sciences (IJIAS), 3(1), 74-85. https://doi.org/10.47540/ijias.v3i1.729 |
| [29] | Prabha, S. K., & Scholar, P. D. (2016). New Algorithm Via Method of Magnitude To Maximize the Profit of a Fuzzy Transportation Problem. 01(05), 1–6. |
| [30] | Seethalakshmy, A., & Srinivasan, N. (2019). Solving a real-life problem using transportation. International Journal of Innovative Technology and Exploring Engineering, 8(10), 4284–4287. https://doi.org/10.35940/ijitee.J1062.0881019 |
| [31] | Silmi Juman, Z. A. M., Masoud, M., Elhenawy, M., Bhuiyan, H., Komol, M. M. R., & Battaïa, O. (2021). A new algorithm for solving uncapacitated transportation problems with interval-defined demands and supplier capacities. Journal of Intelligent and Fuzzy Systems, 41(1), 625–637. https://doi.org/10.3233/JIFS-202436 |
| [32] | Sinha, B., Das, A., & Bera, U. K. (2016). Profit Maximization Solid Transportation Problem with Trapezoidal Interval Type-2 Fuzzy Numbers. International Journal of Applied and Computational Mathematics, 2(1), 41–56. https://doi.org/10.1007/s40819-015-0044-8 |
| [33] | Tjalling C. Koopmans. (1941). Optimum Utilization of the Transportation System Author (s): Tjalling C. Koopmans Source: Econometrica, Vol. 17, Supplement: Report of the Washington Meeting (Jul., 1949), Published by: The Econometric Society Stable URL: http://www.jstor.org. 17, 136–146. |
| [34] | Uddin, S., & Khan, A. R. (2016). Improved Least Cost Method to Obtain a Better IBFS to the Transportation Problem. 6(2), 1–20. |
APA Style
Oshan Niluminda, Uthpala Ekanayake. (2023). The Novel Efficient Method to Solve Balanced and Unbalanced Profit Maximization in Transportation Problems. American Journal of Mathematical and Computer Modelling, 8(2), 17-24. https://doi.org/10.11648/j.ajmcm.20230802.11
ACS Style
Oshan Niluminda; Uthpala Ekanayake. The Novel Efficient Method to Solve Balanced and Unbalanced Profit Maximization in Transportation Problems. Am. J. Math. Comput. Model. 2023, 8(2), 17-24. doi: 10.11648/j.ajmcm.20230802.11
AMA Style
Oshan Niluminda, Uthpala Ekanayake. The Novel Efficient Method to Solve Balanced and Unbalanced Profit Maximization in Transportation Problems. Am J Math Comput Model. 2023;8(2):17-24. doi: 10.11648/j.ajmcm.20230802.11
Share This Article
Twitter
Linked In
Facebook
Copy
Download@article{10.11648/j.ajmcm.20230802.11,
author = {Oshan Niluminda and Uthpala Ekanayake},
title = {The Novel Efficient Method to Solve Balanced and Unbalanced Profit Maximization in Transportation Problems},
journal = {American Journal of Mathematical and Computer Modelling},
volume = {8},
number = {2},
pages = {17-24},
doi = {10.11648/j.ajmcm.20230802.11},
url = {https://doi.org/10.11648/j.ajmcm.20230802.11},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajmcm.20230802.11},
abstract = {Organizations must plan how to get their commodities from production centers to consumers' homes with the least amount of transportation expense to maximize profit. The Transportation Problem (TP) approach is used to evaluate and reduce the cost of transportation. There are two types of TPs. Such as cost minimization TP and profit maximization TP. Typically, the transportation technique is employed for minimization but the objective function should be maximized rather than minimized in several categories of TPs. By changing the maximizing problem into the minimization problem, these types of issues may be resolved in literature. By deducting the unit costs from the table's greatest unit cost, maximizing is changed into minimization. The first step in achieving an optimal solution is to find the initial basic feasible solution (IBFS). North-West Conner, Least Cost, and Vogel’s Approximation Methods can be used to find IBFS. The optimal solution can be obtained by using only Modified Distribution (MODI) and Stepping Stone Methods. This study proposes a novel direct method to find an optimal or near-optimal solution to profit maximization TPs. In this proposed method, maximization TP is not needed to convert minimization TP. This method is very easy and it has less implementation. In the end, by solving several illustrative examples, we compare the proposed method’s results with other existing methods.},
year = {2023}
}
TY - JOUR T1 - The Novel Efficient Method to Solve Balanced and Unbalanced Profit Maximization in Transportation Problems AU - Oshan Niluminda AU - Uthpala Ekanayake Y1 - 2023/10/31 PY - 2023 N1 - https://doi.org/10.11648/j.ajmcm.20230802.11 DO - 10.11648/j.ajmcm.20230802.11 T2 - American Journal of Mathematical and Computer Modelling JF - American Journal of Mathematical and Computer Modelling JO - American Journal of Mathematical and Computer Modelling SP - 17 EP - 24 PB - Science Publishing Group SN - 2578-8280 UR - https://doi.org/10.11648/j.ajmcm.20230802.11 AB - Organizations must plan how to get their commodities from production centers to consumers' homes with the least amount of transportation expense to maximize profit. The Transportation Problem (TP) approach is used to evaluate and reduce the cost of transportation. There are two types of TPs. Such as cost minimization TP and profit maximization TP. Typically, the transportation technique is employed for minimization but the objective function should be maximized rather than minimized in several categories of TPs. By changing the maximizing problem into the minimization problem, these types of issues may be resolved in literature. By deducting the unit costs from the table's greatest unit cost, maximizing is changed into minimization. The first step in achieving an optimal solution is to find the initial basic feasible solution (IBFS). North-West Conner, Least Cost, and Vogel’s Approximation Methods can be used to find IBFS. The optimal solution can be obtained by using only Modified Distribution (MODI) and Stepping Stone Methods. This study proposes a novel direct method to find an optimal or near-optimal solution to profit maximization TPs. In this proposed method, maximization TP is not needed to convert minimization TP. This method is very easy and it has less implementation. In the end, by solving several illustrative examples, we compare the proposed method’s results with other existing methods. VL - 8 IS - 2 ER -
Information
Email: