A Dual-Based Procedure for Uncapacitated Facility Location

We develop and test a method for the uncapacitated facility location problem that is based on a linear programming dual formation. A simple ascent and adjustment procedure frequently produces optimal dual solutions, which in turn often correspond directly to optimal integer primal solutions. If not, a branch-and-bound procedure completes the solution process. This approach has obtained and verified optimal solutions to all the Kuehn-Hamburger location problems in well under 0.1 seconds each on an IBM 360/91 computer, with no branching required. Computational tests on problems with as many as 100 potential facility locations provide evidence that this approach is superior to several other methods.

[1]  B. M. Khumawala.  An efficient heuristic procedure for the uncapacitated warehouse location problem , 1973 .

[2]  Michel Balinski,et al.  Integer Programming: Methods, Uses, Computations , 1965 .

[3]  A. M. Geoffrion.  Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

[4]  J. Krarup,et al.  Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem , 1977 .

[5]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[6]  Patrick D. Krolak,et al.  A man-machine approach toward solving the traveling salesman problem , 1970, DAC '70.

[7]  Kurt Spielberg,et al.  Algorithms for the Simple Plant-Location Problem with Some Side Conditions , 1969, Oper. Res..

[8]  Graciano Sá,et al.  Branch-and-Bound and Approximate Solutions to the Capacitated Plant-Location Problem , 1969, Oper. Res..

[9]  D. Erlenkotter.  Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public , 1977 .

[10]  T. L. Ray,et al.  A Branch-Bound Algorithm for Plant Location , 1966, Oper. Res..

[11]  R. Swain.  A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems , 1974 .

[12]  A. Manne.  Plant Location Under Economies-of-Scale---Decentralization and Computation , 1964 .

[13]  P. S. Davis,et al.  A branch‐bound algorithm for the capacitated facilities location problem , 1969 .

[14]  B. M. Khumawala.  An Efficient Branch and Bound Algorithm for the Warehouse Location Problem , 1972 .

[15]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .

[16]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[17]  L. Schrage.  Implicit representation of variable upper bounds in linear programming , 1975 .

[18]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[19]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .