A scatter search-based heuristic to locate capacitated transshipment points

Computers and Operations Research

Volumn 34, Issue 10, 2007, Pages 3112-3125

  Keskin, Burcu B ^a   Üster, Halit ^a  

^a Texas AandM University   (United States)

Author keywords

Heuristics; Scatter search; Transshipment; Two stage location

Indexed keywords

COMPUTATIONAL METHODS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

COMBINATORIAL OPTIMIZATION PROBLEMS; SCATTER SEARCH; TRANSSHIPMENT; TWO STAGE LOCATION;

HEURISTIC PROGRAMMING;

EID: 33847625433     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.11.020     Document Type: Article

References (34)

1. Hitchcock F.L. The distribution of a product from several sources to numerous localities. Journal of Mathematical Physics 20 (1941) 224-230
2. Laguna M., Martí R. editors. Scatter search: methodology and implementations in C. Boston, MA: Kluwer Academic Publishers; 2003.
3. Rardin R.L., and Uzsoy R. Experimental evaluation of heuristic optimization. Journal of Heuristics 7 (2001) 261-304
4. Kariv O., and Hakimi L. An algorithmic approach to network location problems: part ii: the p-medians. SIAM Journal of Applied Mathematics 37 3 (1979) 539-560
5. Daskin M.S. Network and discrete location: models, applications and algorithms (1995), Wiley, New York, NY
6. Correa E.S., Steiner M.T.A., Freitas A.A., and Carnieri C. A genetic algorithm for solving a capacitated p-median problem. Numerical Algorithms 35 2-4 (2004) 373-388
7. Lorena L.A.N., and Senne E.L.F. A column generation approach to capacitated p-median problems. Computers and Operations Research 31 6 (2004) 863-876
8. Horn M. Analysis and computational schemes for p-median heuristics. Environment and Planning A 28 9 (1996) 1699-1708
9. Rosing K.E., and Hodgson M.J. Heuristic concentration for the p-median: an example demonstrating how and why it works. Computers and Operations Research 29 10 (2002) 1317-1330
10. Alp O., Erkut E., and Drezner Z. An efficient genetic algorithm for the p-median problem. Annals of Operations Research 122 1-4 (2003) 21-42
11. Lim A., and Xu Z. A fixed-length subset genetic algorithm for the p-median problem. Lecture Notes in Computer Science 2724 (2003) 1596-1597
12. Estivill-Castro V., and Torres-Velazquez R. Hybrid genetic algorithm for solving the p-median problem. Lecture Notes in Artificial Intelligence 1585 (1999) 18-25
13. Rolland E., Schilling D.A., and Current J.R. An efficient tabu search procedure for the p-median problem. European Journal of Operational Research 96 2 (1997) 329-342
14. Levanova T.V., and Loresh M.A. Algorithms of ant system and simulated annealing for the p-median problem. Automation and Remote Control 65 3 (2004) 431-438
15. Garcia-Lopez F., Melian-Batista B., and Moreno-Perez J.A. Parallelization of the scatter search for the p-median problem. Parallel Computing 29 5 (2003) 575-589
16. Díaz J.A., and Fernández E. Hybrid scatter search and path relinking for the capacitated p-median problem. European Journal of Operational Research 169 (2006) 570-585
17. Resende M.G.C., and Werneck R.F. A hybrid heuristic for the p-median problem. Journal of Heuristics 10 1 (2004) 59-88
18. Hribar M., and Daskin M.S. A dynamic programming heuristic for the p-median problem. European Journal of Operational Research 101 3 (1997) 499-508
19. Geoffrion A.M., and Graves G.W. Multicommodity distribution system design by benders decomposition. Management Science 20 5 (1974) 822-844
20. Hindi K.S., and Basta T. Computationally efficient solution of a multi-product, two-stage distribution-location problem. Journal of Operations Research Society 45 (1994) 1316-1323
21. Pirkul H., and Jayaraman V. A multi commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution. Computers and Operations Research 25 (1998) 869-878
22. Jayaraman V., and Pirkul H. Planning and coordination of production and distribution facilities for multiple commodities. European Journal of Operational Research 133 (2001) 394-408
23. Tragantalerngsak S., Holt J., and Ronnqvist M. An exact method for the two-echelon, single source, capacitated facility location problem. European Journal of Operational Research 123 (2000) 473-489
24. Tragantalerngsak S., Holt J., and Ronnqvist M. Lagrangian relaxation heuristic for two-echelon, single source, capacitated facility location problem. European Journal of Operational Research 102 (1997) 611-625
25. Klose A. An lp-based heuristic for two-stage capacitated facility location problems. Journal of the Operational Research Society 50 (1999) 157-166
26. Klose A. A Lagrangian relax-and-cut approach for two-stage capacitated facility location problems. European Journal of Operational Research 126 (2000) 408-421
27. Marin A., and Pelegrin B. A branch-and-bound algorithm for the transportation problem with location of p transshipment points. Computers and Operations Research 24 7 (1997) 659-678
28. Marin A., and Pelegrin B. Applying lagrangian relaxation to the resolution of two-stage location problems. Annals of Operations Research 86 (1999) 179-198
29. Gao L., and Robinson E.P. A dual based optimization procedure for the two-echelon uncapacitated facility location problem. Naval Research Logistics 39 (1992) 191-212
30. Glover F. Heuristics for integer programming using surrogate constraints. Decision Sciences 8 (1977) 156-166
31. Martí R.R., Laguna M., and Glover F. Principles of scatter search. European Journal of Operational Research 169 (2006) 359-372
32. Glover F. Artificial evolution, lecture notes in computer science, vol. 1363. Berlin: Springer; 1998.
33. Glover F. Tabu search for nonlinear and parametric optimization. Discrete and Applied Mathematics 49 (1994) 231-255
34. Glover F., and Laguna M. Tabu search (1997), Kluwer Academic Publishers, Norwell, MA