A Template for Scatter Search and Path Relinking

Scatter search and its generalized form called path relinking are evolutionary methods that have recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and problem constraints, these methods use strategies for combining solution vectors that have proved effective for scheduling, routing, financial product design, neural network training, optimizing simulation and a variety of other problem areas. These approaches can be implemented in multiple ways, and offer numerous alternatives for exploiting their basic ideas. We identify a template for scatter search and path relinking methods that provides a convenient and user friendly basis for their implementation. The overall design can be summarized by a small number of key steps, leading to versions of scatter search and path relinking that are fully specified upon providing a handful of subroutines. Illustrative forms of these subroutines are described that make it possible to create methods for a wide range of optimization problems.

[1]  Fred Glover,et al.  PROBABILISTIC AND PARAMETRIC LEARNING COMBINATIONS OF LOCAL JOB SHOP SCHEDULING RULES , 1963 .

[2]  F. Glover.  A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[3]  Harvey J. Greenberg,et al.  Surrogate Mathematical Programming , 1970, Oper. Res..

[4]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[5]  Fred Glover,et al.  Surrogate Constraint Duality in Mathematical Programming , 1975, Oper. Res..

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

[7]  Ronald L. Rardin,et al.  Some relationships between lagrangian and surrogate duality in integer programming , 1979, Math. Program..

[8]  Ronald L. Rardin,et al.  Surrogate Dual Multiplier Search Procedures in Integer Programming , 1984, Oper. Res..

[9]  A. Fréville,et al.  Heuristics and reduction methods for multiple constraints 0-1 linear programming problems , 1986 .

[10]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[11]  Darrell Whitley,et al.  Genitor: a different genetic algorithm , 1988 .

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

[13]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[14]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[15]  A. Fréville,et al.  An exact search for the solution of the surrogate dual of the 0–1 bidimensional knapsack problem , 1993 .

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

[17]  Fred Glover,et al.  Genetic algorithms and scatter search: unsuspected potentials , 1994 .

[18]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[19]  F. Glover.  Scatter search and star-paths: beyond the genetic metaphor , 1995 .

[20]  Fred W. Glover,et al.  New advances and applications of combining simulation and optimization , 1996, WSC.

[21]  Fred W. Glover,et al.  Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..

[22]  J. P. Kelly,et al.  New advances and applications of combining simulation and optimization , 1996, Proceedings Winter Simulation Conference.

[23]  Fred W. Glover,et al.  A scatter search approach for unconstrained continuous optimization , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[24]  James P. Kelly,et al.  A scatter-search-based learning algorithm for neural network training , 1996, J. Heuristics.

[25]  Takeshi Yamada,et al.  Scheduling by Genetic Local Search with Multi-Step Crossover , 1996, PPSN.

[26]  Catherine Roucairol,et al.  A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .

[27]  L. Darrell Whitley,et al.  Bit Representations with a Twist , 1997, ICGA.

[28]  Heinz Mühlenbein,et al.  The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.

[29]  Colin R. Reeves,et al.  Genetic Algorithms for the Operations Researcher , 1997, INFORMS J. Comput..

[30]  S. Zenios,et al.  A model for designing callable bonds and its solution using tabu search , 1997 .

[31]  Colin R. Reeves,et al.  Permutation flowshop scheduling by genetic local search , 1997 .

[32]  V. Cung,et al.  A scatter search based approach for the quadratic assignment problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[33]  H. M. Rwcp.  The equation for the response to selection and its use for prediction , 1997 .

[34]  Colin R. Reeves.  Genetic Algorithms: No Panacea, but a Valuable Tool for the Operations Researcher , 1997, INFORMS J. Comput..

[35]  César Rego,et al.  Relaxed tours and path ejections for the traveling salesman problem , 1998, Eur. J. Oper. Res..

[36]  Éric D. Taillard,et al.  A heuristic column generation method for the heterogeneous fleet VRP , 1999, RAIRO Oper. Res..

[37]  Stavros A. Zenios,et al.  Designing Portfolios of Financial Products via Integrated Simulation and Optimization Models , 1999, Oper. Res..

[38]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..