Computational experience with exterior point algorithms for the transportation problem

Applied Mathematics and Computation

Volumn 158, Issue 2, 2004, Pages 459-475

  Papamanthou, Charalampos ^a   Paparrizos, Konstantinos ^a   Samaras, Nikolaos ^a  

^a UNIVERSITY OF MACEDONIA   (Greece)

Author keywords

Algorithm evaluation; Experimental computational study; Exterior point simplex algorithms; Network simplex algorithm; Transportation problem

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

ALGORITHM EVALUATION; EXTERIOR POINT SIMPLEX ALGORITHMS; NETWORK SIMPLEX ALGORITHMS; TRANSPORTATION PROBLEMS (TP);

COMPUTATIONAL METHODS;

EID: 4744357394     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2003.09.028     Document Type: Article

References (21)

1. Achatz H., Kleinschmidt P., Paparrizos K. A dual forest algorithm for the assignment problem. Dimacs Ser. Discrete Math. Theoret. Comput. Sci. 4:1990;1-10.
2. Achatz H., Paparrizos K., Samaras N., Tsiplidis K. A forest exterior point algorithm for the assignment problems. Pardalos P.M., Migdalas A., Buckard A. Combinatorial and Global Optimization. 2002;1-10 World Scientific Publishing Co.
3. Ahuja R., Magnanti T., Orlin J. Network Flows: Theory, Algorithms and Applications. 1993;Prentice-Hall, Englewood Clifs, NJ.
4. Arsham H., Khan A.B. A simplex type algorithm for general transportation problems: an alternative to stepping-stone. J. Oper. Res. Soc. 40:1989;581-590.
5. Barr R.S., Glover F., Klingman D. The alternating basis algorithm for assignment problems. Math. Program. 13:1977;1-13.
6. Charnes A., Cooper W.W. The stepping-stone method for explaining linear programming calculation in transportation problem. Manage. Sci. 1:1954;49-69.
7. Cova T.J., Johnson J.P. A network flow model for lane-based evacuation routing. Transport. Res. Part A. 37:2003;579-604.
8. Cunningham W.H. A network simplex method. Math. Program. 11:1976;105-116.
9. Dantzig G.B. Application of the simplex method to a transportation problem. Koopmans T.C. Activity of production and application. 1951;359-373 John Wiley & Sons, NY.
10. Koopmans T.C. Optimum utilization of the transportation system. Econometrica. 17:1949;3-4.
11. Liu S. The total cost bounds of the transportation problem with varying demand and supply. OMEGA. 31:2003;247-251.
12. Orlin J.B., Plotkin S.A., Tardos E. Polynomial dual network simplex algorithms. Math. Program. 60:1993;255-276.
13. C. Papamanthou, K. Paparrizos, N. Samaras, A comparative computational study of exterior point algorithms for the assignment problem, J. Algor., submitted for publication.
14. K. Paparrizos, A network exterior point algorithm, Presented at the EURO X Conference on Operational Research, Beograd, Yugoslavia, 1989.
15. K. Paparrizos, A simplex type algorithm for assignment problems initialized with a solution that is neither primal nor dual feasible, in: Proceedings of XXI Conference on Applications of Mathematics in Industry and Business, Varna, Bulgaria, 1995, pp. 152-159.
16. Paparrizos K. An exterior point simplex algorithm for general linear problems. Ann. Oper. Res. 32:1993;497-508.
17. Paparrizos K. An infeasible (exterior point) simplex algorithm for assignment problems. Math. Program. 51:1991;45-54.
18. Portugal L., Bastos F., Judice J., Paixao J., Terlaky T. An investigation of interior point algorithms for the linear transportation problem. SIAM J. Sci. Comput. 17:1996;1202-1223.
19. Ruiz R., Maroto C., Alcaraz J. A decision support system for a real vehicle routing problem. Euro. J. Oper. Res. 153:2003;593-606.
20. Winston W.L. Operations Research, Applications and Algorithms. third ed. 1997;Duxbury Press.
21. Zhang C., Liu J., Wan Y., Murty K.G., Linn R.J. Storage space allocation in container terminals. Transport. Res. Part B. 37:2003;883-903.