A Dual-Based Heuristic Algorithm for the Simple Facility Location Problem

단순 시설입지 선정문제에 대한 쌍대기번 휴리스틱

  • Published : 1987.12.01

Abstract

This paper presents a heuristic algorithm for solving the simple facility location problem. Its main procedure is essentially of 'add' type, which progressively selects facilities to open according to a certain criterion derived from the analysis of the linear programming dual. Computational experience with test problem from the literature is presented.

Keywords

References

  1. Management Sci. v.23 Location of bank accounts to optimize float:an analytic study of exact and approximate algorithms Cornuejols,G.;M.L.Fisher;G.L.Nemhauser
  2. Operations Res. v.26 A dual-based procedure for uncapacitated facility location Erlenkotter,D.
  3. Mathematical Prog. v.17 A direct dual method for the mixed plant location problem with some side constraints Guignard,M.;K.Spielberg
  4. woking paper no.2252 A unified approach to heuristics and algorithms for a class of uncapacitated plant location problems Jacobsen,S.K.
  5. Management Sci. v.10 A heuristic approach to solving traveling salesman problems Karg,R.L.;G.L.Thompson
  6. Operational Res. Quart. v.28 The multi-commodity facilities location problems Karkazis,J.;T.B.Boffey
  7. Comm. ACM v.14 A man-machine approach toward solving the traveling salesman problem Krolak,P.;W.Felts;G.Marble
  8. Management Sci. v.9 A heuristic program for locating warehouses Kuehn,A.A.;M.J.Hamburger
  9. AIIE Trans. v.7 Optimal and heuristic facility phase-out strategies Roodman,G.M.;L.B.Schwarz
  10. AIIE Trans. v.9 Extensions of the multiperiod facility phase-out model: new procedures and applications to a phase-in/phase-out probems Roodman,G.M.;L.B.Schwarz
  11. Operational Res. v.34 A cross decomposition algorithm for capacitated facility location Van Roy,T.J.
  12. Management Sci. v.28 A dual-based procedure for dynamic facility location Van Roy,T.J.;D.Erlenkotter