Solving the simple plant location problem by genetic algorithm

The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.

[1]  John E. Beasley,et al.  Obtaining test problems via Internet , 1996, J. Glob. Optim..

[2]  V. Grishukhin.  On polynomial solvability conditions for the simplest plant location problem , 1988 .

[3]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[4]  Saudi Arabia,et al.  Locational Analysis of the , 1999 .

[5]  J. Galletly.  An Overview of Genetic Algorithms , 1992 .

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

[7]  Caterina De Simone,et al.  Easy instances of the plant location problem , 1996 .

[8]  Bernd Freisleben,et al.  A Genetic Local Search Approach to the Quadratic Assignment Problem , 1997, ICGA.

[9]  Li-Lian Gao,et al.  Uncapacitated facility location: General solution procedure and computational experience , 1994 .

[10]  Thomas Bäck,et al.  An evolutionary approach to combinatorial optimization problems , 1994, CSC '94.

[11]  H. Simão,et al.  A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem , 1989 .

[12]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.

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

[14]  Alexander A. Ageev,et al.  Polynomially Solvable Cases of the Simple Plant Location Problem , 1990, IPCO.

[15]  Leon F. McGinnis,et al.  Invited reviewLocational analysis , 1983 .

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

[17]  C. H. Aikens,et al.  Facility location models for distribution planning , 1985 .

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

[19]  Jin-Kao Hao,et al.  A New Genetic Local Search Algorithm for Graph Coloring , 1998, PPSN.

[20]  Gérard Cornuéjols,et al.  A projection method for the uncapacitated facility location problem , 1990, Math. Program..

[21]  Kenneth A. De Jong,et al.  Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[22]  M. Guignard.  A Lagrangean dual ascent algorithm for simple plant location problems , 1988 .

[23]  Jozef Kratica,et al.  Improving Performances of the Genetic Algorithm by Caching , 1999, Comput. Artif. Intell..

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

[25]  M. B. Tahir,et al.  An overview of Genetic Algorithms , 2003 .

[26]  P. Dearing.  Review of recent developments: Location problems , 1985 .

[27]  Bernd Freisleben,et al.  New Genetic Local Search Operators for the Traveling Salesman Problem , 1996, PPSN.

[28]  K. Holmberg,et al.  Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem , 2001 .

[29]  B. Freisleben,et al.  Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).