A hybrid algorithm for capacitated plant location problem

Expert Systems with Applications

Volumn 37, Issue 12, 2010, Pages 8599-8605

  Lai, Ming Che ^a   Sohn, Han Suk ^b   Tseng, Tzu Liang ^c   Chiang, Chunkuan ^b  

^a YU DA UNIVERSITY   (Taiwan)

^b New Mexico State University   (United States)

^c University of Texas at El Paso   (United States)

Author keywords

Benders' decomposition; Capacity; Genetic algorithm; Mixed integer programming; Plant location

Indexed keywords

BRANCH AND BOUND METHOD; GENETIC ALGORITHMS; INTEGER PROGRAMMING; LOCATION;

BENDERS' DECOMPOSITIONS; CAPACITY; COMPUTATIONAL RESULTS; HYBRID ALGORITHMS; LOCATION PROBLEMS; MASTER PROBLEMS; MIXED INTEGER PROGRAMMING; SUBOPTIMAL SOLUTION;

COMPUTATIONAL EFFICIENCY;

EID: 77957830045     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.06.104     Document Type: Article

References (52)

1. Akinc, U., & Khumawala, M. (1977). An efficient branch and bound algorithm for the capacitated warehouse location problem. Management Science, 23(6), 585-594.
2. Baker, J. E. (1985). Adaptive selection methods for genetic algorithms. In Paper presented at the proceedings of the 1st international conference on genetic algorithms. Pittsburgh, PA, USA.
3. Beasley, J. E. (1988). An algorithm for solving large capacitated warehouse location problems. European Journal of Operational Research, 33, 314-325.
4. Beasley, D., Bull, D. R., & Martin, R. R. (1993). An overview of genetic algorithms: Part 1, fundamentals. University Computing, 15(4), 170-181.
5. Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238-252.
6. Biles, J. A. (2001). GenJam: Evolution of a jazz improviser (1st ed. In P. J. B. David & W. Corne (Eds.). Creative evolutionary systems (The Morgan Kaufmann Series in Artificial Intelligence), pp. 165-188). Morgan Kaufmann.
7. Boffey, T. B. (1989). Location problems arising in computer networks. The Journal of the Operational Research Society, 40, 347-354.
8. Cakir, O. (2009). Benders decomposition applied to multi-commodity, multi-mode distribution planning. Expert Systems with Applications, 36, 8212-8217.
9. Chardaire, P. (1999). Hierarchical two level location problems. In B. Sansò & P. Soriano (Eds.), Telecommunications network planning (pp. 33-54). London, Dordrecht, Boston: Kluwer Academic Publishers Group.
10. Christofides, N., & Beasley, J. E. (1983). Extensions to a Lagrangian relaxation approach for the capacitated warehouse location problem. European journal of operational research, 12(1), 19-28.
11. Cordeau, J.-F., Francois, Soumis., & Jacques, Desrosiers. (2000). A Benders decomposition approach for the locomotive and car assignment problem. Transportation science, 34(2), 133-149.
12. Cordeau, J.-F., Francois, Soumis, & Jacques, Desrosiers (2001). Simultaneous assignment of locomotives and cars to passenger trains. Operations research, 49(4), 531-548.
13. Cornuejols, G., Sridharan, R., & Thizy, J. M. (1991). A comparison of heuristics and relaxations for the capacitated plant location problem. European journal of operational research, 50(3), 280-297.
14. Cortinhal, M. J., & Captivo, M. E. (2003). Upper and lower bounds for the single source capacitated location problem. European journal of operational research, 151(2), 333-351.
15. Davis, L. (1991). Handbook of genetic algorithms. New York: Van Nostrand Reinhold Company.
16. Davis, P. R., & Ray, T. L. (1969). A branch and bound algorithm for the capacitated facilities location problem. Naval Research Logistics Quarterly, 16.
17. Delmaire, H., Díaz, J. A., & Fernández, E. (1999). Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. INFOR, Canadian Journal of Operational Research and Information Processing, 37,194-225.
18. Domschke, W., & Drexl, A. (1985). ADD-heuristics' starting procedures for capacitated plant location models. European journal of operational research, 21(1), 47-53.
19. Ellwein, L. B., & Gray, P. (1971). Solving fixed charge location-allocation problem with capacity and configuration constraints. AI1E Transactions, 3(4), 290-298.
20. Erlenkotter, D. (1978). A dual-based procedure for uncapacitated facility location. Operations Research, 26, 992-1009.
21. Feldman, E., Lehrer, F. A., & Ray, T. L. (1966). Warehouse location under continuous economies of scale. Management Science, 12, 670-684.
22. Geoffrion, A. M., & Graves, G. W. (1974). Multicommodity distribution system design by Benders decomposition. Management science, 20(5), 822-844.
23. Geoffrion, A. M., & McBride, R. (1978). Lagrangian relaxation to capacitated facility location problems. AIIE Transactions, 10, 40-47.
24. Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley Professional.
25. He, S., Chaudhry, S., & Chaudhry, P. (2003). Solving a class of facility location problems using genetic algorithms. Expert Systems, 20(2), 86-91.
26. Heragu, S. S., & Chen, Ja-Shen (1998). Optimal solution of cellular manufacturing system design: Benders' decomposition approach. European journal of operational research, 107, 175-192.
27. Holland, J. H. (1992). Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. Cambridge, MA: The MIT Press.
28. Holmberg, K., & Ling, J. (1997). A Lagrangian heuristic for the facility location problem with staircase costs. European journal of operational research, 97(1), 63-74.
29. Jacobsen, S. K. (1983). Heuristics for the capacitated plant location model. European journal of operational research, 12(3), 253-261.
30. Jaramillo, J. H., Bhadury, J., & Batta, R. (2002). On the use of genetic algorithms to solve location problems. Computers & Operations Research, 29, 761-779.
31. Kennington, J. L., & Whitler, Jason E. (1999). An efficient decomposition algorithm to optimize spare capacity in a telecommunications network. INFORMS Journal on computing, 11(2), 149-160.
32. Khumawala, B. M. (1974). An efficient heuristic procedure for the capacitated warehouse location problem. Naval Research Logistics Quarterly, 21(4), 609-623.
33. Kochmann, G. A., & McCallum, C. J. (1981). Facility location models for planning a transatlantic communications network. European Journal of Operational Research, 6, 205-211.
34. Kratica, J., Tosic, D., Filipovic, V., & Ljubic, I. (2001). Solving the simple plant location problem by genetic algorithm. RAIRO Operations Research, 35, 127-142.
35. Kuehn, A. A., & Hamburger, M. J. (1963). A heuristic program for locating warehouses. Management Science, 9, 643-666.
36. Michalewicz, Z. (1998). Genetic Algorithms + Data Structures = Evolution Programs. New York: Springer.
37. Mirzaian, A. (1985). Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds. Networks, 15, 1-20.
38. Nauss, R. M. (1978). An improved algorithm for the capacitated facility location problem. Journal of the Operational Research Society, 29, 1195-1201.
39. Osman, I. H., & Laporte, G. (1996). Metaheuristcs: A bibliography. Annals of Operations Research, 63, 513-623.
40. Pirkul, H. (1987). Efficient algorithms for the capacitated concentrator location problem. Computers & Operations Research, 14(3), 197-208.
41. Pochet, Y., & Wolsey, L. A. (1988). Lot-size models with backlogging: Strong reformulations and cutting planes. Mathematical Programming, 40, 317-335.
42. Randazzo, C., Luna, H., & Mahey, P. (2001). Benders decomposition for local access network design with two technologies. Discrete mathematics and theoretical computer science, 4, 235-246.
43. Rolland, E., Schilling, D. A., & Current, J. R. (1996). An efficient tabu search procedure for the p-median problem. European Journal of Operational Research, 96, 329-342.
44. Sa, G. (1969). Branch and bound and approximate solutions to the capacitated plant location problem. Operations Research, 17(6), 1005-1016.
45. Salkin, H. M., Mathur, K., & Haas, R. (1989). Foundations of integer programming. Appleton & Lange.
46. Shetty, B. (1990). Approximate solutions to large scale capacitated facility location problems. Applied Mathematics and Computation, 39(2), 159-175.
47. Sridharan, R. (1993). A Lagrangian heuristic for the capacitated plant location problem with single source constraints. European journal of operational research, 66(3), 305-312.
48. Takeshi, U., Masatoshi, S., Kosuke, K., Hideki, K., & Kazutaka, C. (2007). An application of genetic algorithm for facility location problem with A-distance in a competitive environment. Transactions of the Institute of Systems, Control and Information Engineers, 20(3), 106-113.
49. Uno, T., Hanaoka, S., & Sakawa, M. (2005). An application of genetic algorithm for multi-dimensional competitive facility location problem. In Paper presented at the IEEE international conference on systems, man and cybernetics.
50. Van Roy, T. J. (1986). A cross decomposition algorithm for capacitated facility location. Operations Research, 34, 145-163.
51. Van Roy, T. J., & Erlenkotter, D. (1982). Dual-based procedure for dynamic facility location. Management Science, 28, 1091-1105.
52. Whitley, D. (1989). The GENITOR algorithm and selective pressure: Why rank-based allocation of reproductive trials is best. In Paper presented at the Proc. 3rd int. conf. genetic algorithms and their applications. San Mateo, CA.