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. Our computational experiments with four well-known permutation problems reveal that in general a GA with local search outperforms one without it. Using the same problem instances, we observed that our specific scatter search implementation found solutions of a higher average quality earlier during the search than the GA variants.
KeywordsScatter Search Genetic Algorithms Combinatorial Optimization Permutation Problems
Unable to display preview. Download preview PDF.
- Campos, V.,M. Laguna and R. Martí (1999) “Scatter Search for the Linear Ordering Problem,” Corne, Dorigo and Glover (Eds.) New Ideas in Optimization, McGraw-Hill, UK.Google Scholar
- Glover, F. (1977) “Heuristics for Integer Programming Using Surrogate Constraints,” Decision Sciences, 8(7):156–166.Google Scholar
- Glover, F. (1998) “A Template for Scatter Search and Path Relinking,” in Artificial Evolution, Lecture Notes in Computer Science 1363, J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers (Eds.), Springer, 13–54.Google Scholar
- Holland, J.H. (1975) Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI.Google Scholar
- Laguna, M. and R. Martí (2000) “Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions,” Technical Report TR11-2000, Dpto de Estadística e I.O., University of Valencia.Google Scholar
- Lawler, L., R. Kan and Shmoys (1985) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley and Sons.Google Scholar
- Reinelt, G. (1985) “The Linear Ordering Problem: Algorithm and Applications,” Research and Exposition in Mathematics, 8, H.H. Hofman and R. Wille (eds.), Heldermann Verlag, Berlin.Google Scholar
- Reinelt, G. (1994) “The Traveling Salesman: Computational Solutions for TSP applications,” Lecture Notes in Computer Science, Springer Verlag, Berlin.Google Scholar