Scatter Search vs. Genetic Algorithms

The purpose of this work is to compare the performance of a scatter search (SS) implementation and an implementation of a genetic algorithm (GA) in the context of searching for optimal solutions to permutation problems. Scatter search and genetic algorithms are members of the evolutionary computation family. That is, they are both based on maintaining a population of solutions for the purpose of generating new trial solutions. We perform computational experiments with four well-known permutation problems to study and compare the performance of a SS and a GA implementation.

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

[2]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[3]  Gerhard Reinelt,et al.  A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..

[4]  J. Wesley Barnes,et al.  Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs , 1981, Oper. Res..

[5]  Stefan Chanas,et al.  A new heuristic algorithm solving the linear ordering problem , 1996, Comput. Optim. Appl..

[6]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[7]  Gerhard Reinelt,et al.  The linear ordering problem: algorithms and applications , 1985 .

[8]  Fred W. Glover,et al.  Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times , 1993, Applied Intelligence.

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

[10]  Fred W. Glover,et al.  An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem , 2001, J. Glob. Optim..

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

[12]  Fred W. Glover,et al.  Reducing the bandwidth of a sparse matrix with tabu search , 2001, Eur. J. Oper. Res..

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

[14]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

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

[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]  Rafael Martí,et al.  Intensification and diversification with elite tabu search solutions for the linear ordering problem , 1999, Comput. Oper. Res..

[19]  M. Laguna,et al.  Scatter search for the linear ordering problem , 1999 .