THE MULTISTART DROP-ADD-SWAP HEURISTIC FOR THE UNCAPACITATED FACILITY LOCATION PROBLEM

Lin-Yu Tseng, Chih-Sheng Wu

Abstract

The uncapacitated facility location problem aims to select a subset of facilities to open, so that the demands of a given set of customers are satisfied at the minimum cost. In this study, we present a novel multistart Drop-Add-Swap heuristic for this problem. The proposed heuristic is multiple applications of the Drop-Add-Swap heuristic with randomly generated initial solutions. And the proposed Drop-Add-Swap heuristic begins its search with an initial solution, then iteratively applies the Drop operation, the Add operation or the Swap operation to the solution to search for a better one. Cost updating rather than recomputing is utilized, so the proposed heuristic is time efficient. With extensive experiments on most benchmarks in the literature, the proposed heuristic has been shown competitive to the state-of-the-art heuristics and metaheuristics.

References

  1. Ahn, S., Cooper, C., Cornuéjols, G., Frieze, A.M., 1998. Probabilistic analysis of a relaxation for the k-median problem. Mathematics of Operations Research, (13) 1- 31.
  2. Arya, V., Garg, N., Khandekar, R., Meyerson, A., 2001. Munagala K, Pandit V. Local Search heuristics for kmedian and facility location problems. ACM Symposium on Theory of Computing, 21-29.
  3. Barahona, F., Chudak, F., 1999. Near-optimal solutions to large scale facility location problems. Technical Report RC21606, IBM, Yorktown Heights, NY, USA.
  4. Beasley, J.E., 1993. Lagrangean heuristics for location problems. European Journal of Operational Research, (65) 383-399.
  5. Bilde, O., Krarup, J., 1977. Sharp lower bounds and efficient algorithms for the simple plant location problem. Annals of Discrete Mathematics, (1) 79-97.
  6. Cornuéjols, G., Nemhauser, G.L., Wolsey, L.A., 1990. The uncapacitated facility location problem. in: P.B. Mirchandani, R.L. Francis (Eds.), Discrete Location Theory, Wiley-Interscience, New York, 119-171.
  7. Erlenkotter, D., 1978. A dual-based procedure for uncapacitated facility location. Operations Research, (26) 992-1009.
  8. Galvao, R.D., Raggi, L.A., 1989. A method for solving to optimality uncapacitated facility location problems. Annals of Operations Research, (18) 225-244.
  9. Ghosh, D., 2003. Neighborhood search heuristics for the uncapacitated facility location problem. European Journal of Operational Research, (150) 150-162.
  10. Hoefer, M., 2002. Performance of heuristic and approximation algorithms for the uncapacitated facility location problem. Research Report MPI-I2002-1-005, Max-Planck-Institutfür Informatik.
  11. Hoefer, M., 2002. UflLib, http://www.mpisb.mpg.de/units/agl/projects/benhmarks/UflLib.
  12. Jain, K., Mahdian, M., Saberi, A., 2002. A new greedy approach for facility location problems, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, 731-740.
  13. Kochetov, Y., Ivanenko, D., 2003. Computationally difficult instances for the uncapacitated facility location problem. in: Proceedings of the 5th Metaheuristics International Conference (MIC), 41:1- 41:6.
  14. Körkel, M., 1989. On the exact solution of large-scale simple plant location problems, European Journal of Operational Research, (39) 157-173.
  15. Kratica, J., Tosic, D., Fillipovic, V., Ljubic, I., 2001 Solving the simple plant location problem by genetic algorithm. RAIRO Operations Research, (35) 127- 142.
  16. Kuehn, A.A., Hamburger, M.J., 1963 A heuristic program for locating warehouses. Management Science (9) 643-666.
  17. Mahdian, M., Ye, Y., Zhang, J., 2002. 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, SpringerVerlag, 229-242.
  18. Michel, L., Van Hentenryck, P., 2003. A simple tabu search for warehouse locatiohn. European Journal of Operational Research, (157) 576-591.
  19. Nemhauser, G.L., Wolsey, L.A., Fisher, L.M., 1978 An analysis of approximations for maximizing submodular set functions, I. Mathematical Programming, (14) 265-94.
  20. Resende, M.G.C., Werneck, R.F., 2006. A hybrid multistart heuristic for the uncapacitated facility location problem. European Journal of Operational Research, (174) 54-68.
  21. Sun, M., 2006. Solving the uncapacitated facility location problem using tabu search. Computers & Operations Research, (33) 2563-2589.
Download


Paper Citation


in Harvard Style

Tseng L. and Wu C. (2009). THE MULTISTART DROP-ADD-SWAP HEURISTIC FOR THE UNCAPACITATED FACILITY LOCATION PROBLEM . In Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO, ISBN 978-989-8111-99-9, pages 21-28. DOI: 10.5220/0002173100210028


in Bibtex Style

@conference{icinco09,
author={Lin-Yu Tseng and Chih-Sheng Wu},
title={THE MULTISTART DROP-ADD-SWAP HEURISTIC FOR THE UNCAPACITATED FACILITY LOCATION PROBLEM},
booktitle={Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,},
year={2009},
pages={21-28},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002173100210028},
isbn={978-989-8111-99-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics - Volume 3: ICINCO,
TI - THE MULTISTART DROP-ADD-SWAP HEURISTIC FOR THE UNCAPACITATED FACILITY LOCATION PROBLEM
SN - 978-989-8111-99-9
AU - Tseng L.
AU - Wu C.
PY - 2009
SP - 21
EP - 28
DO - 10.5220/0002173100210028