A branching method for the fixed charge transportation problem

Omega

Volumn 38, Issue 5, 2010, Pages 393-397

  Adlakha, Veena ^a   Kowalski, Krzysztof ^b   Lev, Benjamin ^c  

^a UNIVERSITY OF BALTIMORE   (United States)

^b State of Connecticut   (United States)

^c DREXEL UNIVERSITY   (United States)

Author keywords

Fixed charge; Iterative method; Transportation

Indexed keywords

EID: 78650357269     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.omega.2009.10.005     Document Type: Article

References (28)

1. Arsham H., Adlakha V., Lev B. A simplified algebraic method for system for linear equalities with LP applications. OMEGA: The International Journal of Management Science 2009, 37(4):876-882.
2. Adlakha V., Kowalski K. A simple heuristic for solving small fixed-charge transportation problems. OMEGA: The International Journal of Management Science 2003, 31:205-211.
3. Adlakha V., Kowalski K. A simple algorithm for the source-induced fixed charge transportation problem. Journal of the Operational Research Society 2004, 55:1275-1280.
4. Adlakha V., Kowalski K., Vemuganti R.R. Heuristic algorithms for the fixed-charge transportation problem. Opsearch 2006, 43:88-108.
5. Adlakha V., Kowalski K., Vemuganti R.R., Lev B. More-for-less algorithm for fixed-charge transportation problems. OMEGA: The International Journal of Management Science 2007, 35:1-20.
6. Balinski M.L. Fixed cost transportation problems. Naval Research Logistics Quarterly 1961, 8:41-54.
7. Caramia M., Guerreio F. A heuristic approach to long-haul freight transportation with multiple objective functions. OMEGA: The International Journal of Management Science 2009, 37(3):600-614.
8. Cooper L. The fixed charge problem-I: a new heuristic method. Computers & Mathematics with Applications 1975, 1:89-95.
9. Cooper L., Drebes C. An approximate algorithm for the fixed charge problem. Naval Research Logistics Quarterly 1967, 14:101-113.
10. Diaby M. Successive linear approximation procedure for generalized fixed-charge transportation problems. Journal of Operational Research Society 1991, 42:991-1001.
11. Drenzler D.R. An approximate method for the fixed charge problem. Naval Research Logistics Quarterly 1969, 16:411-416.
12. Gray P. Exact solution of the fixed-charge transportation problem. Operations Research 1971, 19:1529-1538.
13. Glover F., Amini M., Kochenberger G. Parametric ghost image processes for fixed charge problems: a study of transportation networks. Journal of Heuristics 2005, 11:307-336.
14. Hirsch W., Danzig G.B. The fixed charge problem. Naval Research Logistics Quarterly 1968, 15:413-424.
15. Kowalski K. On the structure of the fixed charge transportation problem. International Journal of Mathematical Education in Science and Technology 2005, 36:879-888.
16. Kowalski K., Lev B. On step fixed-charge transportation problem. OMEGA: The International Journal of Management Science 2008, 36(5):913-917.
17. Kuhn H.W., Baumol W.J. An approximation algorithm for the fixed charge transportation problem. Naval Research Logistics Quarterly 1962, 9:1-15.
18. Li J.-Q., Borenstein D., Mirchandani P.B. Truck scheduling for solid waste collection in the city of Porto Alegre, Brazil. OMEGA: The International Journal of Management Science 2008, 36(6):1133-1149.
19. Murty K.G. Solving the fixed charge problem by ranking the extreme points. Operations Research 1968, 16:268-279.
20. Ortega F., Wolsey L.A. A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 2003, 41:143-158.
21. Palekar U.S., Karwan M.H., Zionts S. A branch-and-bound method for the fixed charge transportation problem. Management Science 1990, 36:1092-1105.
22. Sadagopan S., Ravindran A. A vertex ranking algorithm for the fixed-charge transportation problem. Journal of Optimization Theory and Applications 1982, 37:221-230.
23. Sandrock K. A simple algorithm for solving small fixed-charge transportation problems. JORS: Journal of the Operational Research Society 1988, 39:467-475.
24. Steinberg D.I. The fixed charge problem. Naval Research Logistics Quarterly 1970, 17:217-235.
25. Sun M., Aronson J.E., McKeown P.G., Drinka D. A tabu search heuristic procedure for the fixed charge transportation problem. European Journal of Operational Research 1998, 106:441-456.
26. Tutuncu G.Y., Carreto C.A.C., Baker B.M. A visual interactive approach to classical and mixed vehicle routing problem with backhauls. OMEGA: The International Journal of Management Science 2009, 37(1):138-154.
27. Walker W.E. A heuristic adjacent extreme point algorithm for the fixed charge problem. Management Science 1976, 22:587-596.
28. Yu M.-M., Lin E.T.J. Efficiency and effectiveness in railway performance using a multi-activity network DEA model. OMEGA: The International Journal of Management Science 2008, 36(6):1005-1017.