Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2647, Issue , 2003, Pages 165-178

  Hoefer, Martin ^a,b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; HEURISTIC ALGORITHMS; TABU SEARCH; WEBSITES;

EXPERIMENTAL COMPARISON; HEURISTIC APPROXIMATION ALGORITHMS; OPERATIONAL RESEARCH; RANDOMIZED ROUNDING; SOLUTION QUALITY; TABU SEARCH ALGORITHMS; UNCAPACITATED FACILITY LOCATIONS; VOLUME ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 35248848870     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44867-5_13     Document Type: Review

References (26)

1. S. Ahn, C. Cooper, G. Cornuéjols and A. M. Frieze. Probabilistic analysis of a relaxation for the k-median problem. Mathematics of Operations Research, 13:1-31, 1988.
2. K. S. Al-Sultan and M. A. Al-Fawzan. A tabu search approach to the uncapacitated facility location problem. Annals of Operations Research, 86:91-103, 1999.
3. M. L. Alves and M. T. Almeida. Simulated annealing algorithm for simple plant location problems. Rev. Invest., 12, 1992.
4. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala and V. Pandit. Local search heuristics for k-median and facility location problems. ACM Symposium on Theory of Computing, pages 21-29, 2001.
5. F. Barahona. An implementation of the Volume algorithm. IBM COIN-OR website, http://oss.software.ibm.com/developerworks/opensource/coin, 2000.
6. F. Barahona and R. Anbil. The Volume algorithm: producing primal solutions with the subgradient method. Technical Report, IBM Watson Research Center, 1998.
7. F. Barahona and F. A. Chudak. Near-optimal solutions to large scale facility location problems. Technical Report, IBM Watson Research Center, 2000.
8. J. E. Beasley. Obtaining Test Problems via Internet. Journal of Global Optimization, 8:429-433, 1996.
9. O. Bilde and J. Krarup. Sharp lower bounds and efficient algorithms for the simple plant location problem. Annals of Discrete Mathematics, 1:79-97, 1977.
10. M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999.
11. F. A. Chudak. Improved approximation algorithms for uncapacitated facility location. In Proceedings of the 6th IPCO Conference, pages 180-194, 1998.
12. R. D. Galvão and L. A. Raggi A method for solving to optimality uncapacitated facility location problems. Annals of Operations Research, 18:225-244, 1989.
13. S. Guha and S. Khuller. Greedy strikes back: Improved facility location algorithms. Journal of Algorithms, 31:228-248, 1999.
14. 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.
15. M. R. Korupolu, C. G. Plaxton and R. Rajaraman. Analysis of a local search heuristic for facility location problems. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, pages 1-10, 1998.
16. J. Kratica, V. Filipovic, V. Sesum and D. Tosic. Solving the uncapacitated warehouse location problem using a simple genetic algorithm. In Proceedings of the XIV International Conference on Material Handling and Warehousing, pages 3.33-3.37, 1996.
17. J. Kratica, D. Tosic and V. Filipovic. Solving the uncapacitated warehouse location problem by sga with add-heuristic. In XV ECPD International Conference on Material Handling and Warehousing, 1998.
18. J. Kratica, D. Tosic, V. Filipovic and I. Ljubic. Solving the simple plant location problem by genetic algorithm. RAIRO Operations Research, 35:127-142. 2001.
19. K. Jain, M. Mahdian and A. Saberi. A new greedy approach for facility location problems. In Proceedings of the 34th Symposium on Theory of Computing 2002, forthcoming, 2002.
20. K. Jain and V. V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and langrangian relaxation. Journal of the ACM, 48:274-296, 2001.
21. M. Mahdian, E. Marakakis, A. Sabieri and V. V. Vazirani. A greedy facility location algorithm analyzed using dual fitting. In Proceedings of 5th International Workshop on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science v. 2129, pages 127-133. Springer-Verlag, 2001.
22. M. Mahdian, Y. Ye and J. Zhang. Improved approximation algorithms for metric facility location problems. In Proceedings of the 5th APPROX Conference, Lecture Notes in Computer Science v. 2462, pages 229 - 242, 2002.
23. P. Van Hentenryck and L. Michel. A simple tabu search for warehouse location. Technical Report, CS-02-05, Brown University, 2002.
24. M. Sviridenko. An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. In Proceedings of the 10th IPCO Conference, Lecture Notes in Computer Science v. 2337, pages 230 - 239, 2002.
25. M. Sun. A Tabu Search Heuristic Procedure for the Uncapacitated Facility Location Problem. In C. Rego and B. Alidaee (eds.) Adaptive Memory and Evolution: Tabu Search and Scatter Search, Kluwer Academic Publishers, forthcoming, 2002.
26. UflLib. UFLP-benchmarks, optimization code and benchmark generators. |http://www.mpi-sb.mpg.de/units/ag1/projects/benchmarks/UflLib-, 2002.