Genetic algorithms for the single source capacitated location problem

The single source capacitated location problem is considered. Given a set of potential locations and the plant capacities, it must be decided where and how many plants must be open and which clients must be assigned to each open plant. Genetic algorithms that use different methodologies for handling constraints are described and tested. Computational experiments on different sets of problems are presented.

[1]  R. Sridharan.  A Lagrangian heuristic for the capacitated plant location problem with single source constraints , 1993 .

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

[3]  S Salhi,et al.  Lagrangean heuristics applied to a variety of large capacitated plant location problems , 1998, J. Oper. Res. Soc..

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

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

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

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

[8]  Ramaswami Sridharan,et al.  A heuristic Lagrangean algorithm for the capacitated plant location problem — A comment , 1986 .

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

[10]  Maria João Cortinhal,et al.  Upper and lower bounds for the single source capacitated location problem , 2003, Eur. J. Oper. Res..

[11]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[12]  Adriano O. De Maio,et al.  An all Zero-One Algorithm for a Certain Class of Transportation Problems , 1971, Oper. Res..

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

[14]  J. Barceló,et al.  A heuristic lagrangean algorithm for the capacitated plant location problem , 1984 .

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

[16]  K. Darby-Dowman,et al.  Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem , 1988 .

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

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

[19]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[20]  P. Moscato,et al.  The number partitioning problem: an open challenge for evolutionary computation? , 1999 .

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