Fundamentals of Scatter Search and Path Relinking

Abstract —The evolutionary approach called Scatter Search, and its generalized form called Path Relinking, have proved unusually effective for solving a diverse array of optimization problems from both classical and real world settings. Scatter Search and Path Relinking differ from other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalized path constructions (in both Euclidean and neighborhood spaces) and by utilizing strategic designs where other approaches resort to randomization. Scatter Search and Path Relinking are also intimately related to the Tabu Search metaheuristic, and derive additional advantages by making use of adaptive memory and associated memory-exploiting mechanisms that are capable of being adapted to particular contexts. We describe the features of Scatter Search and Path Relinking that set them apart from other evolutionary approaches, and that offer opportunities for creating increasingly more versatile and effective methods in the future.

[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]  Fred W. Glover,et al.  The general employee scheduling problem. An integration of MS and AI , 1986, Comput. Oper. Res..

[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]  Emile H. L. Aarts,et al.  Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.

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

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

[16]  Edmund K. Burke,et al.  A Genetic Algorithm for University Timetabling , 1994 .

[17]  Jun Gu,et al.  Efficient Local Search With Search Space Smoothing: A Case Study of the Traveling Salesman Problem (TSP) , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[18]  Fred W. Glover.  Optimization by ghost image processes in neural networks , 1994, Comput. Oper. Res..

[19]  Patrick D. Surry,et al.  Formal Memetic Algorithms , 1994, Evolutionary Computing, AISB Workshop.

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

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

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

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

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

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

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

[27]  Fred W. Glover,et al.  Surrogate constraint analysis-new heuristics and learning schemes for satisfiability problems , 1996, Satisfiability Problem: Theory and Applications.

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

[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]  Charu C. Aggarwal,et al.  Optimized Crossover for the Independent Set Problem , 1997, Oper. Res..

[33]  J. M. Singer,et al.  Search-space smoothing for combinatorial optimization problems , 1997 .

[34]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[35]  Egon Balas,et al.  Optimized Crossover-Based Genetic Algorithms for the Maximum Cardinality and Maximum Weight Clique Problems , 1998, J. Heuristics.

[36]  Helena Ramalhinho-Lourenço,et al.  Metaheuristics for the bus-driver scheduling problem , 1998 .

[37]  George C. Runger,et al.  See the forest before the trees: fine-tuned learning and its application to the traveling salesman problem , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[38]  David B. Fogel,et al.  An Introduction to Evolutionary Computation , 2022 .

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

[40]  Rafael Martí,et al.  Intensification and diversification with elite tabu search solutions for the linear ordering problem , 1999, Comput. Oper. Res..

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

[42]  Fred Glover,et al.  Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory , 1999, INFORMS J. Comput..

[43]  F. Glover.  Scatter search and path relinking , 1999 .

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

[45]  Bruce L. Golden,et al.  A computational study of smoothing heuristics for the traveling salesman problem , 2000, Eur. J. Oper. Res..

[46]  David L. Woodruff,et al.  Scatter Search to Generate Diverse MIP Solutions , 2000 .

[47]  Manuel Laguna,et al.  Assigning Proctors to Exams with Scatter Search , 2001 .

[48]  Jiefeng Xu,et al.  Tabu Search and Evolutionary Scatter Search for ‘Tree‐Star’ Network Problems, with Applications to Leased‐Line Network Design , 2001 .

[49]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

[50]  Ramón Alvarez-Valdés,et al.  A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems , 2002, Comput. Oper. Res..

[51]  H. Schwefel,et al.  \genetic Local Search Algorithms for the Traveling Salesman Problem," in Parallel Problem Solving from Nature Edited , 2022 .