Experimental analysis of some variants of Vogel's approximation method

Asia-Pacific Journal of Operational Research

Volumn 21, Issue 4, 2004, Pages 447-462

  Mathirajan, M ^a   Meenakshi, B ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Computational experiments; Heuristic; Total opportunity cost; Transportation problem; Vogel's approximation method

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; LINEAR PROGRAMMING; MATRIX ALGEBRA; PROBLEM SOLVING; RANDOM ACCESS STORAGE; TRANSPORTATION;

COMPUTATIONAL EXPERIMENTS; TOTAL OPPORTUNITY COST; TRANSPORTATION PROBLEM; VOGEL APPROXIMATION METHOD;

APPROXIMATION THEORY;

EID: 10944261322     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595904000333     Document Type: Article

References (21)

1. Arsham, H and AB Kahn (1989). A simplex-type algorithm for general transportation problems: An alternative to Stepping-Stone. Journal of Operational Research Society, 40(6), 581-590.
2. Charnes, A and WW Cooper (1954). The Stepping-Stone method for explaining linear programming calculations in transportation problems. Management Science, 1(1), 49-69.
3. Dantzig, GB (1963). Linear Programming and Extensions, Princeton, NJ: Princeton University Press.
4. Dhose, ED and KR Morrison (1996). Using transportation solutions for a facility location problem. Computers and Industrial Engineering, 31(1/2), 63-66.
5. Gass, SI (1990). On solving the transportation problem. Journal of Operational Research Society, 41(4), 291-297.
6. Glover, F, D Karney, D Klingman and A Napier (1974). A computation study on start procedures, basis change criteria, and solution algorithms for transportation problems. Management Science, 20(5), 793-813.
7. Goyal, SK (1984). Improving VAM for unbalanced transportation problems. Journal of Operational Research Society, 35(12), 1113-1114.
8. Goyal, SK (1991). A note on a heuristic for obtaining an initial solution for the transportation problem. Journal of Operational Research Society, 42(9), 819-821.
9. Ji, P and KF Chu (2002). A dual-matrix approach to the transportation problem. Asia-Pacific Journal of Operations Research, 19(1), 35-45.
10. Kirca, O and A Satir (1990). A heuristic for obtaining an initial solution for the transportation problem. Journal of Operational Research Society, 41(9), 865-871.
11. Raghavendra, BG and M Mathirajan (1987). Optimal allocation of buses to depots - a case study. OPSEARCH, 24(4), 228-239.
12. Ramakrishnan, CS (1988). An improvement to Goyal's modified VAM for the unbalanced transportation problem. Journal of Operational Research Society, 39(6), 609-610.
13. Reinfeld, NV and WR Vogel (1958). Mathematical Programming. Englewood Cliffs, New Jersey: Prentice-Hall.
14. Schrage, L (1991a). UNDO - An Optimization Modeling System, 4th edition. CA, USA: The Scientific Press.
15. Schrage, L (1991b). UNDO - User's Manual: Release 5.0. CA, USA: The Scientific Press.
16. Shafaat, A and SK Goyal (1988). Resolution of degeneracy in transportation problems. Journal of Operational Research Society, 39(4), 411-413.
17. Sharma, RRK and KD Sharma (2000). A new dual based procedure for the transportation problem. European Journal of Operational Research, 122, 611-624.
18. Shih, W (1987). Modified Stepping-Stone method as a teaching aid for capacitated transportation problems. Decision Sciences, 18, 662-676.
19. Shimshak, DG, JA Kaslik and TD Barclay (1981). A modification of Vogel's approximation method through the use of heuristics. INFOR, 19, 259-263.
20. Sridharan, R (1991). Allocation of buses to depots: a case study. Vikalpa, The Journal for Decision Makers, 16(2), 27-32.
21. Vasudevan, J, E Malini and DJ Victor (1993). Fuel savings in bus transit using depotterminal bus allocation model. Journal of Transport Management, 17(7), 409-416.