Transportation challenges often occur in logistics and supply chain management, necessitating the movement of commodities from several sources to different destinations while minimizing transportation expenses. This paper proposes a Dual-Spread Opportunity VAM (DSO-VAM) for obtaining high-quality initial basic feasible solutions to transportation problems. The method is motivated by a revised VAM framework that improves classical penalty-based allocation by modifying row and column penalties. To address some limitations of existing methods, the proposed method combines dual-spread row and column penalties with an opportunity-based decision score that measures the future regret of postponing a low-cost allocation. A fixed weighting mechanism is introduced so that the relative influence of cost spread and allocation pressure changes dynamically throughout the solution process. Numerical examples show that DSO-VAM matches or improves upon the solutions obtained by NWCM, MCM, VAM, and the Revised-VAM. The proposed framework preserves computational simplicity while providing a more flexible and globally informed allocation rule for transportation optimization.
References
[1]
Hitchcock, F.L. (1941) The Distribution of a Product from Several Sources to Numerous Localities. JournalofMathematicsandPhysics, 20, 224-230. https://doi.org/10.1002/sapm1941201224
[2]
Koopmans, T.C. (1947) Optimum Utilization of the Transportation System. Econometrica, 17, 136-146. https://doi.org/10.2307/1907301
[3]
Dantzig, G.B. (1963) Linear Programming and Extentions. Princeton University Press.
[4]
Charnes, A. and Cooper, W.W. (1954) The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems. ManagementScience, 1, 49-69. https://doi.org/10.1287/mnsc.1.1.49
[5]
Reinfeld, N.V. and Vogel, W.R. (1958) Mathematical Programming. Prentice-Hall, 59-70.
[6]
Russell, E.J. (1969) Letters to the Editor—Extension of Dantzig’s Algorithm to Finding an Initial Near-Optimal Basis for the Transportation Problem. OperationsResearch, 17, 187-191. https://doi.org/10.1287/opre.17.1.187
[7]
Khan, A.R. (2011) A Resolution of the Transportation Problem: An Algorithmic Approach. Jahangirnagar University Journal of Science, 34, 49-62.
[8]
Khan, A.R. (2012) Analysis and Resolution of the Transportation Problem: A Linear Programming Approach. Doctoral Dissertation, Jahangirnagar University.
[9]
Sudhakar, V.J., Arunsankar, N. and Karpagam, T. (2012) A New Approach for Finding an Optimal Solution for Transportation Problems. European Journal of Scientific Research, 68, 254-257.
[10]
Cosma, O., Pop, P.C. and D?nciulescu, D. (2020) A Novel Matheuristic Approach for a Two-Stage Transportation Problem with Fixed Costs Associated to the Routes. Computers&OperationsResearch, 118, Article 104906. https://doi.org/10.1016/j.cor.2020.104906
[11]
Hossain, M.M. (2020) Improved Average Penalty Cost (IAPC) Method to Obtain Initial Basic Feasible Solution of Transportation Problem. Global Journal of Science Frontier Research, 20, 23-36.
[12]
Edokpia, R.O. and Amiolemhen, P.E. (2016) Transportation Cost Minimization of a Manufacturing Firm Using Genetic Algorithm Approach. Nigerian Journal of Technology, 35, 866-873.
[13]
Fulkerson, D.R. (1961) A Network Flow Computation for Project Cost Curves. Management Science, 7, 167-178. https://doi.org/10.1287/mnsc.7.2.167
[14]
Ghassemi Tari, F. (2016) A Hybrid Dynamic Programming for Solving Fixed Cost Transportation with Discounted Mechanism. Journal of Optimization, 2016, 1-9. https://doi.org/10.1155/2016/8518921
[15]
Girmay, N. and Sharma, T. (2013) Balance an Unbalanced Transportation Problem by a Heuristic Approach. International Journal of Mathematics and Its Applications, 1, 12-18.
[16]
Juman, Z.A.M.S. and Hoque, M.A. (2015) An Efficient Heuristic to Obtain a Better Initial Feasible Solution to the Transportation Problem. Applied Soft Computing, 34, 813-826. https://doi.org/10.1016/j.asoc.2015.05.009
[17]
Klingman, D. and Russell, R. (1975) Solving Constrained Transportation Problems. Operations Research, 23, 91-106. https://doi.org/10.1287/opre.23.1.91
[18]
Rashid, F., Khan, A.R. and Uddin, M.S. (2021) Mixed Constraints Cost Minimization Transportation Problem: An Effective Algorithmic Approach. American Journal of Operational Research, 11, 1-7.
[19]
Damc?-Kurt, P., Dey, S.S. and Kü?ükyavuz, S. (2015) On the Transportation Problem with Market Choice. Discrete Applied Mathematics, 181, 54-77. https://doi.org/10.1016/j.dam.2014.09.008
[20]
Maity, G. and Kumar Roy, S. (2016) Solving a Multi-Objective Transportation Problem with Nonlinear Cost and Multi-Choice Demand. International Journal of Management Science and Engineering Management, 11, 62-70. https://doi.org/10.1080/17509653.2014.988768
[21]
Christi, M.A. and Kalpana, I. (2016) Solutions of Multi Objective Fuzzy Transportation Problems with Non-Linear Membership Functions. International Journal of Engineering Research and Application, 6, 52-57.
[22]
Yeola, M.C. and Jahav, V.A. (2016) Solving Multi-Objective Transportation Problem Using Fuzzy Programming Technique Parallel Method. International Journal of Recent Scientific Research, 7, 8455-8457.
[23]
Azad, S.M.A.K., Hossain, M.B. and Rahman, M.M. (2017) An Algorithmic Approach to Solve Transportation Problems with the Average Total Opportunity Cost Method. International Journal of Scientific and Research Publications, 7, 266-270.
[24]
Pandian, P., Natarajan, G. and Akilbasha, A. (2016) Fully Rough Integer Interval Transportation Problems. International Journal of Pharmacy and Technology, 8, 13866-13876.
[25]
Pandian, P., Natarajan, G. and Akilbasha, A. (2018) Fuzzy Interval Integer Transportation Problems. International Journal of Pure and Applied Mathematics, 119, 133-142.
[26]
Porchelvi, R.S. and Anitha, M. (2018) On Solving Multi Objective Interval Transportation Problem Using Fuzzy Programming Technique. International Journal of Pure and Applied Mathematics, 118, 483-491.
[27]
Hussein, H.A., Shiker, M.A.K. and Zabiba, M.S.M. (2020) A New Revised Efficient of VAM to Find the Initial Solution for the Transportation Problem. Journal of Physics: Conference Series, 1591, Article 012032. https://doi.org/10.1088/1742-6596/1591/1/012032
[28]
Juman, Z.A.M.S. and Nawarathne, N.G.S.A. (2019) An Efficient Alternative Approach to Solve a Transportation Problem. Ceylon Journal of Science, 48, 19-29. https://doi.org/10.4038/cjs.v48i1.7584
[29]
Soomro, A.S., Junaid, M. and Tularam, G. (2015) Modified Vogel’s Approximation Method for Solving Transportation Problems. Mathematical Theory and Modelling, 5, 32-42.
[30]
Hakim, M.A. (2012) An Alternative Method to Find Initial Basic Feasible Solution of a Transportation Problem. Annals of Pure and Applied Mathematics, 1, 203-209.
[31]
Karagul, K. and Sahin, Y. (2020) A Novel Approximation Method to Obtain Initial Basic Feasible Solution of Transportation Problem. JournalofKingSaudUniversity: EngineeringSciences, 32, 211-218. https://doi.org/10.1016/j.jksues.2019.03.003