Ejection chains, reference structures and alternating path methods for traveling salesman problems
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Tabu Search
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization
INFORMS Journal on Computing
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
Experiments on the minimum linear arrangement problem
Journal of Experimental Algorithmics (JEA)
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
Computers and Operations Research
A survey on optimization metaheuristics
Information Sciences: an International Journal
| Hi-index | 0.00 |
Scatter search SS and path relinking PR are evolutionary methods that have been successfully applied to a wide range of hard optimization problems. The fundamental concepts and principles of the methods were first proposed in the 1970s and 1980s, and were based on formulations, dating back to the 1960s, for combining decision rules and problem constraints. The methods use strategies for search diversification and intensification that have proved effective in a variety of optimization problems and that have sometimes been embedded in other evolutionary methods to yield improved performance. This paper examines the scatter search and path relinking methodologies from both conceptual and practical points of view, and identifies certain connections between their strategies and those adopted more recently by particle swarm optimization. The authors describe key elements of the SS & PR approaches and apply them to a hard combinatorial optimization problem: the minimum linear arrangement problem, which has been used in applications of structural engineering, VLSI and software testing.