Abstract
For most combinatorial optimization problems the computational complexity of evaluating a single solution is much higher than the cost of evaluating an incremental change made by a local search operator. To benefit from this computational gain crossover can be implemented as a path–following algorithm. As a result crossover becomes more similar to path relinking. In this paper we compare the search bias of crossover and path relinking for permutation problems where the absolute position of the elements is decisive. Calculations show that uniform permutation crossover (UPX) can reach many more permutations from a given parent couple than path relinking. UPX is therefore more exploratory than random path relinking, which is itself more exploratory than greedy path relinking. It is important for users to understand the differences in search bias of the operators so they can choose the exploration operator which they deem most fit for their problem. We conclude with a small experiment on an instance of the quadratic assignment problem.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Corne, D., Glover, F., Dorigo, M. (eds.): New Ideas in Optimization. McGraw-Hill, New York (1999)
Cela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, Dordrecht (1998)
Falkenauer, E.: A Hybrid Grouping Genetic Algorithm for Bin Packing. Journal of Heuristics 2, 5–30 (1996)
Fleurent, C., Ferland, J.A.: Genetic Hybrids for the Quadratic Assignment Problem. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pp. 173–187 (1994)
Galinier, P., Hao, J.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4), 379–397 (1999)
Hoos, H.H., Stützle, T.: Stochastic Local Search. Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)
James, T., Rego, C., Glover, F.: Sequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment Problem. IEEE Intelligent Systems, 58–65 (July/August 2005)
Merz, P., Freisleben, B.: Fitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem. IEEE Transaction Evolutionary Computation 4(4), 337–352 (2000)
Osman, I.H., Kelly, J.P. (eds.): Meta-Heuristics: The Theory and Applications. Kluwer Academic Publishers, Boston (1996)
Ribeiro, C.C., Hansen, P. (eds.): Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, Boston (2001)
Stützle, T., Dorigo, M.: Local Search and Metaheuristics for the Quadratic Assignment Problem. Technical Report AIDA-01-01, Intellectics Group, Darmstadt University of Technology, Germany (2001)
Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.): Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Boston (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thierens, D. (2006). Exploration and Exploitation Bias of Crossover and Path Relinking for Permutation Problems. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_104
Download citation
DOI: https://doi.org/10.1007/11844297_104
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38990-3
Online ISBN: 978-3-540-38991-0
eBook Packages: Computer ScienceComputer Science (R0)