A tabu search heuristic procedure for the fixed charge transportation problem

European Journal of Operational Research

Volumn 106, Issue 2-3, 1998, Pages 441-456

  Sun, Minghe ^a   Aronson, Jay E ^b   McKeown, Patrick G ^b   Drinka, Dennis ^c  

^a UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

^b UNIVERSITY OF GEORGIA   (United States)

^c UNIVERSITY OF ALASKA ANCHORAGE   (United States)

Author keywords

Fixed charge transportation problem; Flow algorithms; Integer algorithms; Integer heuristic; Networks graphs; Programming; Tabu search

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; RANDOM PROCESSES; STORAGE ALLOCATION (COMPUTER);

FIXED CHARGE TRANSPORTATION PROBLEMS; FLOW ALGORITHMS; INTEGER ALGORITHMS; INTEGER HEURISTICS; TABU SEARCH METHODS;

TRANSPORTATION CHARGES;

EID: 0032046512     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00284-1     Document Type: Article

References (50)

1. Aronson, J.E., 1989. A survey of dynamic network flows. Annals of Operations Research 20, 1-66.
2. Balinski, M.L., 1961. Fixed cost transportation problem. Naval Research Logistics Quarterly 8, 41-54.
3. Barr, R.S., Glover, F., Klingman, D., 1981. A new optimization method for large scale fixed charge transportation problems. Operations Research 29 (3), 448-463.
4. Bradley, G.G., Brown, G., Graves, G., 1977. Design and implementation of large scale primal transshipment algorithms. Management Science 24 (1), 1-35.
5. Cabot, A.V., Erenguc, S.S., 1984. Some branch-and-bound procedures for fixed-cost transportation problems. Naval Research Logistics Quarterly 31, 145-154.
6. Cabot, A.V., Erenguc, S.S., 1986. Improved penalties for fixed cost linear programs using lagrangean relaxation. Management Science 32 (7), 856-869.
7. Cooper, L., 1975. The fixed charge problem-1: A new heuristic. Computers and Mathematics with Applications 1(1), 89-96.
8. de Werra, D., Hertz, A., 1989. Tabu search techniques: A tutorial and an application to neural networks. OR Spectrum 11, 131-141.
9. Dwyer, P.S., 1966. Use of completely reduced matrices in solving transportation problems with fixed charges. Naval Research Logistics Quarterly 13 (3), 289-313.
10. Evans, J.R., Minieka, E., 1992. Optimization Algorithms for Networks and Graphs. 2nd ed. Marcel Dekker, New York.
11. Fisk, J., McKeown, P.G., 1979. The pure fixed charge transportation problem. Naval Research Logistics Quarterly 26, 631-641.
12. Glover, F., 1989a. Candidate Strategies and Tabu Search. CAAI Research Report, University of Colorado, Boulder, CO.
13. Glover, F., 1989b. Tabu search: Part I. ORSA Journal on Computing 1 (3), 190-206.
14. Glover, F., 1990a. Tabu search: Part II. ORSA Journal on Computing 2 (1), 4-32.
15. Glover, F., 1990b. Tabu search: A tutorial. Interfaces 20 (4), 74-94.
16. Glover, F., 1993. Solving zero-one mixed integer programming problems using tabu search. Graduate School of Business, University of Colorado, Boulder, CO.
17. Glover, F., 1994a. Tabu search fundamentals and uses. Graduate School of Business, University of Colorado. Boulder, CO.
18. Glover, F., 1994b. Tabu search: Improved solution alternatives. In: Birge, J.R., Murty, K.G. (Eds.), Mathematical Programming: State of the Art 1994. The University of Michigan, Ann Arbor, MI.
19. Glover, F., Klingman, D., Phillips, N.V., 1992. Network Models in Optimization and Their Applications in Practice. Wiley, New York.
20. Glover, F., Laguna, M., 1997. Tabu Search. Kluwer Academic Publishers, Hingham, MA.
21. Glover, F., Taillard, E., de Werra, D., 1993. A user's guide to tabu search. Annals of Operations Research 41 (1-4), 3-28.
22. Gray, P., 1971. Exact solution of the fixed-charge transportation problem. Operations Research 19 (6), 1529-1538.
23. Hirsch, W.M., Dantzig, G.B., 1968. The fixed charge problem. Naval Research Logistics Quarterly 15, 413-424.
24. Kennington, J.L., 1976. The fixed-charge transportation problem: A computational study with a branch-and-bound code. AIIE Transactions 8, 241-247.
25. Kennington, J.L., Helgason, R.V., 1980. Algorithms for Network Programming. Wiley, New York.
26. Kennington, J.L., Unger, E., 1976. A new branch-and-bound algorithm for the fixed charge transportation problem. Management Science 22 (10), 1116-1126.
27. Klingman, D., Napier, A., Stutz, J., 1974. NETGEN - A program for generating large scale (Un)Capacitated assignment, transportation, and minimum cost flow network problems. Management Science 20 (5), 814-822.
28. Kuhn, H.W., Baumol, W.J., 1961. An approximate algorithm for the fixed-charge transportation problem. Naval Research Logistics Quarterly 9 (1), 1-16.
29. Malek-Zavarei, M., Frisch, I.T., 1972. On the fixed cost flow problem. International Journal of Control 16 (5), 897-902.
30. McKeown, P.G., 1975. A vertex ranking procedure for solving the linear fixed charge problem. Operations Research 23, 1183-1191.
31. McKeown, P.G., 1981. A branch-and-bound algorithm for solving fixed charge problems. Naval Research Logistics 28, 607-617.
32. McKeown, P.G., Ragsdale, C.T., 1990. A computational study of using preprocessing and stronger formulations to solve general fixed charge problems. Computers and Operations Research 17, 9-16.
33. McKeown, P.G., Sinha, P., 1980. An easy solution to a special class of fixed charge problems. Naval Research Logistics Quarterly 25, 621-624.
34. Murty, K.G., 1968. Solving the fixed charge problem by ranking the extreme points. Operations Research 16, 268-279.
35. Murty, K.G., 1992. Network Programming. Prentice-Hall, Englewood Cliffs, NJ, 1992.
36. Palekar, U.S., Karwan, M.K., Zionts, S., 1990. A branch-and-bound method for the fixed charge transportation problem. Management Science 36 (9), 1092-1105.
37. Rousseau, J.-M., 1973. A cutting plane method for the fixed cost problem. Doctoral dissertation, Massachusetts Institute of Technology, Cambridge, MA.
38. Schaffer, J.E., 1989. Use of penalties in the branch-and-bound procedure for the fixed charge transportation problem. European Journal of Operational Research 43, 305-312.
39. Shetty, U.S., 1990. A relaxation decomposition algorithm for the fixed charge network problem. Naval Research Logistic Quarterly 37 (2), 327-340.
40. Steinberg, D.I., 1970. The fixed charge problem. Naval Research Logistics Quarterly 17 (2), 217-236.
41. Steinberg, D.I., 1977. Designing a heuristic for the fixed-charge transportation problem. Reprints in Mathematics and the Mathematical Sciences. Southern Illinois University at Edwardsville, Edwardsville, IL.
42. Sun, M., Aronson, J.E., McKeown, P.G., 1992. Solving fixed charge transportation problems using tabu search. Presented at the ORSA/TIMS Joint National Meeting, San Francisco, CA.
43. Sun, M., Drinka, D., Aronson, J.E., 1995. Implementation data structures for a tabu search heuristic procedure for solving the fixed charge transportation problem. Proceedings of the Decision Sciences Institute 1995 Annual Meeting, Boston, MA, pp. 915-917.
44. Sun, M., McKeown, P.G., 1993. Tabu search applied to the general fixed charge problem. Annals of Operations Research 41 (1-4), 405-420.
45. Walker, W.E., 1976. A heuristic adjacent extreme point algorithm for the fixed charge problem. Management Science 22 (3), 587-596.
46. Wright, D., Haehling von Lanzenauer, C., 1989. Solving the fixed charge problem with lagrangian relaxation and cost allocation heuristics. European Journal of Operational Research 42, 304-312.
47. Wright, D., Haehling von Lanzenauer, C., 1991. COLE: A new heuristic approach for solving the fixed charge problem - Computational results. European Journal of Operational Research 52, 235-246.
48. Zangwill, W.I., 1966. A deterministic multiperiod production scheduling model with backloggings. Management Science 13, 105-119.
49. Zangwill, W.I., 1968. Minimum concave cost flows in certain networks. Management Science 14 (7), 429-450.
50. Zangwill, W.I., 1969. A backlogging model and a multi-echelon model of a dynamic economic lot size production system - A network approach. Management Science 15 (9), 506-527.