A hybrid multistart heuristic for the uncapacitated facility location problem

European Journal of Operational Research

Volumn 174, Issue 1, 2006, Pages 54-68

  Resende, Mauricio G C ^a   Werneck, Renato F ^b  

^a AT AND T LABS RESEARCH   (United States)

^b Princeton University   (United States)

Author keywords

Facility location; GRASP; Heuristic; Local search; p median problem; Path relinking

Indexed keywords

ALGORITHMS; BENCHMARKING; PATHOLOGY; PROBLEM SOLVING;

GRASP; LOCAL SEARCH; P-MEDIAN PROBLEMS; PATH-RELINKING;

HEURISTIC METHODS;

EID: 33845252250     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.02.046     Document Type: Article

References (39)

1. Ahn S., Cooper C., Cornuéjols G., and Frieze A.M. Probabilistic analysis of a relaxation for the k-median problem. Mathematics of Operations Research 13 (1998) 1-31
2. Alves M.L., and Almeida M.T. Simulated annealing algorithm for the simple plant location problem: A computational study. Revista Investigação Operacional 12 (1992)
3. F. Barahona, F. Chudak, Near-optimal solutions to large scale facility location problems. Technical Report RC21606, IBM, Yorktown Heights, NY, USA, 1999.
4. Beasley J. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41 (1990) 1069-1072. http://mscmga.ms.ic.ac.uk/info.html http://mscmga.ms.ic.ac.uk/info.html
5. Beasley J.E. Lagrangean heuristics for location problems. European Journal of Operational Research 65 (1993) 383-399
6. Bilde O., and Krarup J. Sharp lower bounds and efficient algorithms for the simple plant location problem. Annals of Discrete Mathematics 1 (1977) 79-97
7. Conn A.R., and Cornuéjols G. A projection method for the uncapacited facility location problem. Mathematical Programming 46 (1990) 273-298
8. Cornuéjols G., Nemhauser G.L., and Wolsey L.A. The uncapacitated facility location problem. In: Mirchandani P.B., and Francis R.L. (Eds). Discrete location theory (1990), Wiley-Interscience, New York 119-171
9. J.J. Dongarra, Performance of various computers using standard linear equations software. Technical Report CS-89-85, Computer Science Department, University of Tennessee, 2003.
10. Erlenkotter D. A dual-based procedure for uncapacitated facility location. Operations Research 26 (1978) 992-1009
11. Galvão R.D., and Raggi L.A. A method for solving to optimality uncapacitated facility location problems. Annals of Operations Research 18 (1989) 225-244
12. D. Ghosh, 2003. Personal communication.
13. Ghosh D. Neighborhood search heuristics for the uncapacitated facility location problem. European Journal of Operational Research 150 (2003) 150-162
14. Glover F. Tabu search and adaptive memory programming: Advances, applications and challenges. In: Barr R.S., Helgason R.V., and Kennington J.L. (Eds). Interfaces in Computer Science and Operations Research (1996), Kluwer 1-75
15. Glover F., Laguna M., and Martí R. Fundamentals of scatter search and path relinking. Control and Cybernetics 39 (2000) 653-684
16. Guha S., and Khuller S. Greedy strikes back: Improved facility location algorithms. Journal of Algorithms 31 (1999) 228-248
17. Guignard M. A Lagrangean dual ascent algorithm for simple plant location problems. European Journal of Operations Research 35 (1988) 193-200
18. M. Hoefer, Performance of heuristic and approximation algorithms for the uncapacitated facility location problem. Research Report MPI-I-2002-1-005, Max-Planck-Institut für Informatik, 2002.
19. M. Hoefer, Ufllib, 2002. http://www.mpi-sb.mpg.de/units/agl/projects/benchmarks/UflLib/.
20. M. Hoefer, Experimental comparision of heuristic and approximation algorithms for uncapacitated facility location, in: Proceedings of the Second International Workshop on Experimental and Efficient Algorithms (WEA), volume 2647 of Lecture Notes in Computer Science, Springer-Verlag, 2003, pp. 165-178.
21. Jain K., Mahdian M., Markakis E., Saberi A., and Vazirani V.V. Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM 50 6 (2003) 795-824
22. K. Jain, M. Mahdian, A. Saberi, A new greedy approach for facility location problems, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, 2002, pp. 731-740.
23. Y. Kochetov, Benchmarks library, 2003. http://www.math.nsc.ru/LBRT/-k5/Kochetov/bench.html.
24. Y. Kochetov, D. Ivanenko. Computationally difficult instances for the uncapacitated facility location problem, in: Proceedings of the 5th Metaheuristics International Conference (MIC), 2003, pp. 41:1-41:6.
25. Körkel M. On the exact solution of large-scale simple plant location problems. European Journal of Operational Research 39 (1989) 157-173
26. Kratica J., Tosic D., Filipovic V., and Ljubic I. Solving the simple plant location problem by genetic algorithm. RAIRO Operations Research 35 (2001) 127-142
27. Kuehn A.A., and Hamburger M.J. A heuristic program for locating warehouses. Management Science 9 4 (1963) 643-666
28. Laguna M., and Martí R. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing 11 (1999) 44-52
29. M. Mahdian, Y. Ye, J. Zhang, Improved approximation algorithms for metric facility location problems, in: Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), volume 2462 of Lecture Notes in Computer Science, Springer-Verlag, 2002, pp. 229-242.
30. Matsumoto M., and Nishimura T. Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Transactions on Modeling and Computer Simulation 8 1 (1998) 3-30
31. Michel L., and Van Hentenryck P. A simple tabu search for warehouse location. European Journal on Operations Research 157 3 (2003) 576-591
32. Resende M.G.C., and Ribeiro C.C. Greedy randomized adaptive search procedures. In: Glover F., and Kochenberger G. (Eds). Handbook of metaheuristics (2003), Kluwer 219-249
33. Resende M.G.C., and Ribeiro C.C. GRASP with path-relinking: Recent advances and applications. In: Ibaraki T., Nonobe K., and Yagiura M. (Eds). Metaheuristics: Progress as real problem solvers (2005), Springer 29-63
34. M.G.C. Resende, R.F. Werneck, A fast swap-based local search procedure for location problems. Technical Report TD-5R3KBH, AT&T Labs Research, 2003.
35. M.G.C. Resende, R.F. Werneck, On the implementation of a swap-based local search procedure for the p-median problem, in: R.E. Ladner (Ed.), Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (ALENEX), SIAM, 2003, pp. 119-127.
36. Resende M.G.C., and Werneck R.F. A hybrid heuristic for the p-median problem. Journal of Heuristics 10 1 (2004) 59-88
37. D.B. Shmoys, É. Tardos, K. Aardal, Approximation algorithms for facility location problems, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, 1997, pp. 265-274.
38. M. Sun, A tabu search procedure for the uncapacitated facility location problem, in: C. Rego, B. Alidaee (Eds.), Adaptive Memory and Evolution: Tabu Search and Scatter Search, Kluwer, in press.
39. M. Sun, Solving uncapacitated facility location problems using tabu search. Journal of Heuristics, submitted for publication.