A Cross Decomposition Algorithm for Capacitated Facility Location

We present an implementation of the Cross Decomposition method to solve the capacitated facility location problem. The method unifies Benders Decomposition and Lagrangean relaxation into a single framework that involves successive solutions to a transportation problem and a simple plant location problem. Computational tests on problems with as many as 100 candidate facility locations and 200 customers provide evidence that the approach is superior to several other methods. The specialized Cross Decomposition program is, on a common set of test problems, about ten times faster than several recently developed programs. We also present a simple algorithm to strengthen Benders cuts.

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

[2]  B. M. Khumawala,et al.  An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem , 1977 .

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

[4]  Gerald G. Brown,et al.  Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .

[5]  Tony J. Van Roy,et al.  Cross decomposition for mixed integer programming , 1983, Math. Program..

[6]  Ludo Gelders,et al.  Solving a distribution problem with side constraints , 1981 .

[7]  Ronald L. Rardin,et al.  Some computationally relevant group theoretic structures of fixed charge problems , 1976, Math. Program..

[8]  Tony J. Van Roy,et al.  A Dual-Based Procedure for Dynamic Facility Location , 1982 .

[9]  Robert M. Nauss,et al.  An Improved Algorithm for the Capacitated Facility Location Problem , 1978 .

[10]  Monique Guignard-Spielberg,et al.  A direct dual method for the mixed plant location problem with some side constraints , 1979, Math. Program..

[11]  Thomas L. Magnanti,et al.  Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..

[12]  Fred Glover,et al.  A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems , 1974 .

[13]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[14]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[15]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[16]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[17]  Nicos Christofides,et al.  Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem , 1983 .

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

[19]  J. F. Benders.  Partitioning procedures for solving mixed-variables programming problems , 1962 .