## Scatter Search and Path Relinking (1999)

### Cached

### Download Links

Citations: | 121 - 29 self |

### BibTeX

@MISC{Glover99scattersearch,

author = {Fred Glover},

title = { Scatter Search and Path Relinking},

year = {1999}

}

### Years of Citing Articles

### OpenURL

### Abstract

The evolutionary approach called scatter search, and its generalized form called path relinking, originated from strategies for creating composite decision rules and surrogate constraints. Recent studies demonstrate the practical advantages of these approaches for solving a diverse array of optimization problems from both classical and real world settings. Scatter search and path relinking contrast with 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. Additional advantages are provided by intensification and diversification mechanisms that exploit adaptive memory, drawing on foundations that link scatter search and path relinking to tabu search. The goal of this paper is to clarify the connection between these developments in evolutionary methods, and to highlight key ideas and research issues that offer promise of yielding future advances.

### Citations

333 | The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best - Whitley - 1989 |

166 | Heuristic for Integer Programming using Surrogate Constraints. Decision Sciences
- Glover
- 1977
(Show Context)
Citation Context ... separately in the original vectors, (2) take advantage of auxiliary heuristic solution methods to evaluate the combinations produced and to generate new vectors. The original form of scatter search (=-=Glover, 1977-=-) may be sketched as follows. 2 Surrogate constraint methods give rise to a mathematical duality theory associated with their role as relaxation methods for optimization (e.g., see Greenberg and Piers... |

108 | Probabilistic diversification and intensification in local search for vehicle routing - Rochat, Taillard - 1995 |

92 | GENITOR: a different genetic algorithm, in - Whitley, Kauth - 1988 |

87 | GRASP and path relinking for 2-layer straight line crossing minimization - Laguna, Martí - 1999 |

66 | Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Glover
- 1996
(Show Context)
Citation Context ...solution. In this type of construction a reference structure guides the moves selected to assure that a feasible solution can always be generated by one or more associated trial solutions (see, e.g., =-=Glover, 1992-=-; Rego 1996; Rego and Roucairol, 1996). In these instances the Filter and Fan Method can accordingly be modified to rely on the trial solutions as a basis for evaluating the L-moves generated. The com... |

63 | Genetic local search algorithms for the traveling salesman problem - Laarhoven, Pesch |

48 | Tabu search for nonlinear and parametric optimization (with links to genetic algorithms - Glover - 1991 |

42 | Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory - Fleurent, Glover - 1999 |

38 | The general employee scheduling problem. An integration of - Glover, McMillan - 1986 |

26 | Genetic algorithms for the operations research - Reeves - 1997 |

25 | Efficient Local Search with Search Space Smoothing: A Case Study of the Travelling Salesman Problem (TSP - Gu, Huang - 1994 |

25 | New Advances and Applications of Combining Simulation and Optimization - Glover, Kelly, et al. - 1996 |

25 | Surrogate Constraint Duality in Mathematical Programming - Glover - 1975 |

23 | Scheduling by Genetic Local Search with Multi-Step Crossover - Yamada, Ryohei - 1996 |

20 | Optimized crossover for the independent set problem - Aggarwal, Orlin, et al. - 1997 |

19 | Permutation Flowshop Scheduling by Genetic Local Search - Yamada, Reeves - 1997 |

18 |
Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
- Balas, Niehaus
- 1998
(Show Context)
Citation Context ...irst consider the creation of paths that join two selected solutions x and x , restricting attention to the part of the path that lies ‘between’ the solutions, producing a solution sequence x = x(l),x=-=(2)-=-,. . . ,x(r) = x . To reduce the number of options to be considered, the solution x(i + 1) may be created from x(i) at each step by choosing a move that leaves a reduced number of moves remaining to r... |

18 | Bit Representations with a Twist - Rana, Whitley - 1997 |

16 | An exact search for the solution of the surrogate dual of the 0–1 bidimensional knapsack problem - Fréville, Plateau - 1993 |

16 | Some Relationships Between Lagrangean and Surrogate Duality - Karwan, Rardin - 1979 |

15 | Quasi-Conjugate Functions and Surrogate Duality, Cahiers Centre Etudes Recherche Operationnelle 15(4 - Greenberg, Pierskalla - 1973 |

14 | Probabilistic and parametric learning combinations of local job shop scheduling rules - Crowston, Glover, et al. - 1963 |

14 | A heuristic column generation method for the heterogeneous fleet vrp - Taillard - 1999 |

13 | Scatter Search to Generate Diverse MIP Solutions - Glover, Løkketangen, et al. - 2000 |

13 | Scatter Search and Star Paths: Beyond the Genetic Metaphor - Glover - 1995 |

12 |
Heuristics and Reduction Methods for Multiple Constraint 0-1 Linear Programming Problems
- Freville, Plateau
- 1986
(Show Context)
Citation Context ... to a mathematical duality theory associated with their role as relaxation methods for optimization (e.g., see Greenberg and Pierskalla, 1970, 1973; Glover, 1965, 1975; Karwan and Rardin, 1976, 1979; =-=Freville and Plateau, 1986-=-, 1993).5 Scatter Search Procedure 1. Generate a starting set of solution vectors by heuristic processes designed for the problem considered, and designate a subset of the best vectors to be referenc... |

12 | Surrogate Constraint Duality - Glover - 1975 |

11 | Optimizing Complex Systems with OptQuest,‖ Research Report - Laguna - 1997 |

11 | Surrogate Constraint Analysis — New Heuristics and Learning Schemes for Satisfiability - Lokketangen, Glover - 1997 |

9 | Designing Portfolios of Financial Products via Integrated Simulation and Optimization Models - Consiglio, Zenios - 1999 |

9 | A Scatter Search Approach for Unconstrained Continuous Optimization - Fleurent, Glover, et al. - 1996 |

9 |
A Multiphase Dual Algorithm for the Zero-One Integer Programming Problem
- Glover
- 1965
(Show Context)
Citation Context ...s follows. 2 Surrogate constraint methods give rise to a mathematical duality theory associated with their role as relaxation methods for optimization (e.g., see Greenberg and Pierskalla, 1970, 1973; =-=Glover, 1965-=-, 1975; Karwan and Rardin, 1976, 1979; Freville and Plateau, 1986, 1993).5 Scatter Search Procedure 1. Generate a starting set of solution vectors by heuristic processes designed for the problem cons... |

9 | Metaheuristics for the bus-driver scheduling problem - Lourenço, H, et al. - 2001 |

8 | A Scatter Search-Based Learning Algorithm for Neural Networks Training - Kelly - 1996 |

7 |
Parametric Combinations of Local Job Shop Rules
- Glover
- 1963
(Show Context)
Citation Context ...g may be viewed as evolutionary algorithms that construct solutions by combining others, and derive their foundations from strategies originally proposed for combining decision rules and constraints (=-=Glover, 1963-=-, 1965). The goal of these procedures is to enable a solution procedure based on the combined elements to yield better solutions than one based only on the original elements. Historically, the anteced... |

5 | See the forest before the trees: Fine-tuned learning and its application to the traveling salesman problem - Coy, Golden, et al. - 1998 |

5 | Genetic Algorithms and Scatter Search - Glover - 1994 |

5 | Optimization by Ghost Image - Glover - 1994 |

5 |
Surrogate Dual Multiplier Search
- Karwan, Rardin
- 1976
(Show Context)
Citation Context ...te constraint methods give rise to a mathematical duality theory associated with their role as relaxation methods for optimization (e.g., see Greenberg and Pierskalla, 1970, 1973; Glover, 1965, 1975; =-=Karwan and Rardin, 1976-=-, 1979; Freville and Plateau, 1986, 1993).5 Scatter Search Procedure 1. Generate a starting set of solution vectors by heuristic processes designed for the problem considered, and designate a subset ... |

4 | A computational Study of Smoothing Heuristics for the Traveling Salesman Problem,” Research report - Coy, Golden, et al. - 1998 |

3 | A Model for Designing Callable Bonds and its Solution Using Tabu Search - Consiglio, Zenios - 1997 |

3 | An Improved Search Template for Job-Shop Scheduling,” INFORMS Spring Meeting - Jain, Meeran - 1998 |

3 | Tabu Search with Path Relinking for the Linear Ordering Problem,‖ Research Report - Laguna, Martí, et al. - 1997 |

3 | On Evolution, Search, Optimization Algorithms and Martial Arts: Towards Memetic Algorithms - Moscato - 1989 |

3 | Integrating Advanced Principles of Tabu Search for the Vehicle Routing Problem,” Working Paper, Faculty of Sciences - Rego - 1999 |

3 | Searchspace smoothing for combinatorial optimization problems - Schneider, Dankesreiter, et al. |

3 | A Memetic Algorithm for University Timetabling," in The Practice and Theory of Automated Timetabling - Burke, Newall, et al. - 1996 |

2 | An Introduction to Evolutionary Computation,” Chapter 1 of Evolutionary Computation: The Fossil - Fogel - 1998 |

2 | A Multi-Level Hybrid Framework for the General Flow-Shop Scheduling - Jain, Meeran - 1998 |