Scatter Search Vs. Genetic Algorithms: An Experimental Evaluation with Permutation Problems

R. Martí, M. Laguna and V. Campos
In Metaheuristic Optimization Via Adaptive Memory and Evolution: Tabu Search and Scatter Search, C. Rego and B. Alidaee (eds.), Norwell, MA: Kluwer Academic Publishers, pp. 263-282 (2005)

horizontal rule

Abstract

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.

horizontal rule

Full text

Back Home Up Next