Exploration and Exploitation Bias of Crossover and Path Relinking for Permutation Problems

  • Dirk Thierens
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4193)


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.


Local Search Combinatorial Optimization Problem Memetic Algorithm Local Search Algorithm Quadratic Assignment Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Corne, D., Glover, F., Dorigo, M. (eds.): New Ideas in Optimization. McGraw-Hill, New York (1999)Google Scholar
  2. 2.
    Cela, E.: The Quadratic Assignment Problem: Theory and Algorithms. Kluwer Academic Publishers, Dordrecht (1998)MATHGoogle Scholar
  3. 3.
    Falkenauer, E.: A Hybrid Grouping Genetic Algorithm for Bin Packing. Journal of Heuristics 2, 5–30 (1996)CrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Galinier, P., Hao, J.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4), 379–397 (1999)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Hoos, H.H., Stützle, T.: Stochastic Local Search. Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)MATHGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Merz, P., Freisleben, B.: Fitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem. IEEE Transaction Evolutionary Computation 4(4), 337–352 (2000)CrossRefGoogle Scholar
  9. 9.
    Osman, I.H., Kelly, J.P. (eds.): Meta-Heuristics: The Theory and Applications. Kluwer Academic Publishers, Boston (1996)MATHGoogle Scholar
  10. 10.
    Ribeiro, C.C., Hansen, P. (eds.): Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, Boston (2001)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Dirk Thierens
    • 1
  1. 1.Institute of Information and Computing SciencesUniversiteit UtrechtThe Netherlands

Personalised recommendations