Branch and peg algorithms for the simple plant location problem

The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This problem often appears as a subproblem in other combinatorial problems. Several branch and bound techniques have been developed to solve these problems. In this paper we present two techniques that enhance the performance of branch and bound algorithms. The new algorithms thus obtained are called branch and peg algorithms, where pegging refers to fixing values of variables at each subproblem in the branch and bound tree, and is distinct from variable fixing during the branching process. We present exhaustive computational experiments which show that the new algorithms generate less than 60% of the number of subproblems generated by branch and bound algorithms, and in certain cases require less than 10% of the execution times required by branch and bound algorithms.

[1]  J. Beasley.  Lagrangean heuristics for location problems , 1993 .

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

[3]  G. Nemhauser,et al.  On the Uncapacitated Location Problem , 1977 .

[4]  Boris Goldengorin,et al.  Requirements of Standards: Optimization Models and Algorithms , 1995 .

[5]  James G. Morris,et al.  On the Extent to Which Certain Fixed-Charge Depot Location Problems can be Solved by LP , 1978 .

[6]  M. Rao,et al.  An Algorithm for the M-Median Plant Location Problem , 1974 .

[7]  Laurence A. Wolsey,et al.  Valid inequalities for mixed 0-1 programs , 1986, Discret. Appl. Math..

[8]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

[9]  Gerard Sierksma,et al.  Solving the Simple Plant Location Problem using a Data Correcting Approach , 2003, J. Glob. Optim..

[10]  Gilbert Laporte,et al.  The Plant Location Problem: New Models and Research Prospects , 1996, Oper. Res..

[11]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

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

[13]  David W. Pentico,et al.  The Discrete Two-Dimensional Assortment Problem , 1988, Oper. Res..

[14]  David W. Pentico,et al.  The Assortment Problem with Nonlinear Cost Functions , 1976, Oper. Res..

[15]  M. Guignard,et al.  Algorithms for Exploiting the Structure of the Simple Plant Location Problem , 1977 .

[16]  G. A. Tijssen,et al.  The Data-Correcting Algorithm for the Minimization of Supermodular Functions , 1999 .

[17]  Linus Schrage,et al.  Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming , 1985, Oper. Res..

[18]  D. Chinhyung Cho,et al.  On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems , 1983, Math. Oper. Res..

[19]  Egon Balas,et al.  On the Set-Covering Problem , 1972, Oper. Res..

[20]  Peter L. Hammer,et al.  Boolean and Graph Theoretic Formulations of the Simple Plant Location Problem , 1987, Transp. Sci..

[21]  Manfred Padberg,et al.  On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets , 1983, Math. Oper. Res..

[22]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[23]  Haldun Süral,et al.  Multidimensional assortment problem with an application , 1999, Networks.

[24]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[25]  Nicos Christofides,et al.  Graph theory: An algorithmic approach (Computer science and applied mathematics) , 1975 .

[26]  Cyrille Mukendi,et al.  Sur l'implantation d'équipement dans un réseau : le problème de m-centre , 1975 .

[27]  G. Cornuéjols,et al.  A Primal Approach To the Simple Plant Location Problem , 1982 .

[28]  Timothy J. Lowe,et al.  Specially Structured Uncapacitated Facility Location Problems , 1995, Oper. Res..

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

[30]  Robert Fourer,et al.  Special Issue: OR/MS and E-Business: Optimization as an Internet Resource , 2001, Interfaces.

[31]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[32]  Manfred Körkel.  On the exact solution of large-scale simple plant location problems , 1989 .