A scatter search-based heuristic to locate capacitated transshipment points

We consider a fixed charge two-stage location problem in which a given number of intermediate transshipment points are to be located between the supply plants and the customer locations. Both plants and transshipment points are capacitated. Scatter search is a population-based heuristic that has been applied to several combinatorial optimization problems. We develop an efficient scatter search-based heuristic approach with hybrid improvements including local search and path-relinking routines. Computational results demonstrate the effectiveness of the heuristic even for realistic problems with larger instances and tighter capacities.

[1]  Fred W. Glover,et al.  Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms) , 1994, Discret. Appl. Math..

[2]  Manfred Horn.  Analysis and Computational Schemes for p-Median Heuristics , 1996 .

[3]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[4]  Khalil S. Hindi,et al.  Computationally Efficient Solution of a Multiproduct, Two-Stage Distribution—Location Problem , 1994 .

[5]  Andrew Lim,et al.  A Fixed-Length Subset Genetic Algorithm for the p-Median Problem , 2003, GECCO.

[6]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[7]  Hasan Pirkul,et al.  A multi-commodity, multi-plant, capacitated facility location problem: formulation and efficient heuristic solution , 1998, Comput. Oper. Res..

[8]  F. Glover.  HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[9]  Blas Pelegrín,et al.  A branch-and-bound algorithm for the transportation problem with location of p transshipment points , 1997, Comput. Oper. Res..

[10]  Alex Alves Freitas,et al.  A Genetic Algorithm for Solving a Capacitated p-Median Problem , 2004, Numerical Algorithms.

[11]  Blas Pelegrín,et al.  Applying Lagrangian relaxation to the resolution of two‐stage location problems , 1999, Ann. Oper. Res..

[12]  Mauricio G. C. Resende,et al.  A Hybrid Heuristic for the p-Median Problem , 2004, J. Heuristics.

[13]  Luiz Antonio Nogueira Lorena,et al.  A column generation approach to capacitated p-median problems , 2004, Comput. Oper. Res..

[14]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[15]  T. V. Levanova,et al.  Algorithms of Ant System and Simulated Annealing for the p-median Problem , 2004 .

[16]  E. Powell Robinson,et al.  A dual-based optimization procedure for the two-echelon uncapacitated facility location problem , 1992 .

[17]  J. Current,et al.  An efficient tabu search procedure for the p-Median Problem , 1997 .

[18]  Fred W. Glover,et al.  Principles of scatter search , 2006, Eur. J. Oper. Res..

[19]  F. L. Hitchcock.  The Distribution of a Product from Several Sources to Numerous Localities , 1941 .

[20]  Hasan Pirkul,et al.  Planning and coordination of production and distribution facilities for multiple commodities , 2001, Eur. J. Oper. Res..

[21]  Andreas Klose,et al.  An LP-based heuristic for two-stage capacitated facility location problems , 1999, J. Oper. Res. Soc..

[22]  M. Rönnqvist,et al.  Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem , 1997 .

[23]  Zvi Drezner,et al.  An Efficient Genetic Algorithm for the p-Median Problem , 2003, Ann. Oper. Res..

[24]  Michelle R. Hribar,et al.  A dynamic programming heuristic for the P-median problem , 1997 .

[25]  Reha Uzsoy,et al.  Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial , 2001, J. Heuristics.

[26]  Vladimir Estivill-Castro,et al.  Hybrid Genetic Algorithm for Solving the p-Median Problem , 1998, SEAL.

[27]  Belén Melián-Batista,et al.  Parallelization of the scatter search for the p-median problem , 2003, Parallel Comput..

[28]  UzsoyReha,et al.  Experimental Evaluation of Heuristic Optimization Algorithms , 2001 .

[29]  Andreas Klose,et al.  A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem , 2000, Eur. J. Oper. Res..

[30]  Mikael Rönnqvist,et al.  An exact method for the two-echelon, single-source, capacitated facility location problem , 2000, Eur. J. Oper. Res..

[31]  M. John Hodgson,et al.  Heuristic concentration for the p-median: an example demonstrating how and why it works , 2002, Comput. Oper. Res..

[32]  Juan A. Díaz,et al.  Hybrid scatter search and path relinking for the capacitated p , 2006, Eur. J. Oper. Res..