A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem

This paper considers the Single Source Capacitated Plant Location Problem (SSCPLP). We propose an exact algorithm in which a column generation procedure for finding upper and lower bounds is incorporated within a Branch-and-Price framework. The bounding procedure exploits the structure of the problem by means of an iterative approach. At each iteration, a two-level optimization problem is considered. The two levels correspond with the two decisions to be taken: first, the selection of a subset of plants to be opened and then, the allocation of clients within the subset of open plants. The second level subproblem is solved using column generation. The algorithm has been tested with different sets of test problems and the obtained results are satisfactory.

[1]  R. D. Galvão,et al.  A tabu search heuristic for the concentrator location problem , 1998 .

[2]  K. Jörnsten,et al.  Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing , 1990 .

[3]  Hugues Delmaire,et al.  REACTIVE GRASP AND TABU SEARCH BASED HEURISTICS FOR THE SINGLE SOURCE CAPACITATED PLANT LOCATION PROBLEM , 1999 .

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

[5]  E. Balas.  A class of location, distribution and scheduling problems : modeling and solution methods , 1982 .

[6]  Hasan Pirkul,et al.  Efficient algorithms for the capacitated concentrator location problem , 1987, Comput. Oper. Res..

[7]  Hanan Luss,et al.  A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints , 1986 .

[8]  E. Fern,et al.  Comparing New Heuristics for the Pure Integer Capacitated Plant Location Problem , 1999 .

[9]  J. Beasley.  An algorithm for solving large capacitated warehouse location problems , 1988 .

[10]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[11]  M. Guignard,et al.  Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems , 1990 .

[12]  K S Hindi,et al.  Efficient solution of large scale, single-source, capacitated plant location problems , 1999, J. Oper. Res. Soc..

[13]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

[14]  Di Yuan,et al.  An exact algorithm for the capacitated facility location problems with single sourcing , 1999, Eur. J. Oper. Res..

[15]  W. G. Lesso,et al.  Models for the Minimum Cost Development of Offshore Oil Fields , 1972 .

[16]  C. Sandi.  Solution of the Machine Loading Problem with Binary Variables , 1995 .

[17]  M. Fisher,et al.  A multiplier adjustment method for the generalized assignment problem , 1986 .

[18]  K. Jörnsten,et al.  Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem , 1991 .

[19]  M. R. Rao,et al.  An Algorithm for the Fixed-Charge Assigning Users to Sources Problem , 1983 .

[20]  G. Nemhauser,et al.  Integer Programming , 2020 .

[21]  Lester Randolph Ford,et al.  A Suggested Computation for Maximal Multi-Commodity Network Flows , 2004, Manag. Sci..

[22]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[23]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .