Article

Topological crossover for the permutation representation

Authors:

Alberto Moraglio,

Riccardo PoliAuthors Info & Claims

GECCO '05: Proceedings of the 7th annual workshop on Genetic and evolutionary computation

Pages 332 - 338

https://doi.org/10.1145/1102256.1102330

Published: 25 June 2005 Publication History

Get Access

Abstract

Topological crossovers are a class of representation-independent operators that are well-defined once a notion of distance over the solution space is defined. In this paper we explore how the topological framework applies to the permutation representation and in particular analyze the consequences of having more than one notion of distance available. Also, we study the interactions among distances and build a rational picture in which pre-existing recombination/crossover operators for permutation fit naturally. Lastly, we also analyze the application of topological crossover to TSP.

References

[1]

Bäck T, Fogel DB, Michalewicz Z (2000) Evolutionary Computation 1: Basic Algorithms and Operators. IOP Publishing, Bristol, UKT.

Google Scholar

[2]

Bäck T, Fogel D and Michalewicz Z (1997) Handbook of evolutionary computation. IOP Publishing and Oxford University Press, New York

Digital Library

Google Scholar

[3]

Caprara A (1997) Sorting by reversals is difficult, Proc. of the 1st Ann. International Conference on Computational Molecular Biology (RECOMB 97), pages 75--83, ACM, New York.

Digital Library

Google Scholar

[4]

Deza M and Huang T (1998) Metrics on permutations, a survey, J. Combinatorics, Information and System Sciences 23, pages 173--185.

Google Scholar

[5]

Fox B R and McMahon M B (1991) Genetic Operators for Sequencing Problems In G J E Rawlins, editor, Foundations of Genetic Algorithms, pages 284--300. Morgan Kaufmann.

Google Scholar

[6]

Glover F and Kochenberger G (2002) Handbook of Metaheuristics. Kluwer Academic.

Google Scholar

[7]

Goldberg D E (1989) Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA.

Digital Library

Google Scholar

[8]

Kececioglu J and Sankoff D (1995) Exact and approximate algorithms for sorting by reversals, with applications to genome rearrangement. Algorithmica, 13, pages 180--210.

Google Scholar

[9]

Moraglio A and Poli R (2004) Topological interpretation of crossover. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2004), pages 1377--1388.

Crossref

Google Scholar

[10]

Radcliffe N J (1992) Nonlinear genetic representations. In R. Manner and B. Manderick, editors, Proceedings of the 2 nd Conference on Parallel Problems Solving from Nature, pages 259--268. Morgan Kaufmann.

Google Scholar

[11]

Radcliffe N J (1994) The Algebra of Genetic Algorithms, Annals of Maths and Artificial Intelligence 10, pages 339--384.

Crossref

Google Scholar

[12]

Solomon A, Sutcliffe P, Lister R (2003) Sorting Circular Permutations by Reversals. WADS 2003, pages 319--328

Crossref

Google Scholar

[13]

Vergara J P C (1997) Sorting by Bounded Permutations, Virginia Polytechnic Institute, PhD thesis.

Digital Library

Google Scholar

Cited By

View all

Yoon YKim Y(2013)Geometricity of genetic operators for real-coded representationApplied Mathematics and Computation10.1016/j.amc.2013.05.018219:23(10915-10927)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.1016/j.amc.2013.05.018
Moraglio AMoore J(2012)Geometry of evolutionary algorithmsProceedings of the 14th annual conference companion on Genetic and evolutionary computation10.1145/2330784.2330942(1317-1344)Online publication date: 7-Jul-2012
https://dl.acm.org/doi/10.1145/2330784.2330942
Yoon YKim YMoraglio AMoon B(2012)Quotient geometric crossovers and redundant encodingsTheoretical Computer Science10.1016/j.tcs.2011.08.015425(4-16)Online publication date: 1-Mar-2012
https://dl.acm.org/doi/10.1016/j.tcs.2011.08.015
Show More Cited By

Index Terms

Topological crossover for the permutation representation
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Escaping Local Optima with Diversity Mechanisms and Crossover
GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016
Population diversity is essential for the effective use of any crossover operator. We compare seven commonly used diversity mechanisms and prove rigorous run time bounds for the (μ+1) GA using uniform crossover on the fitness function Jump_k. All ...
Best-order crossover for permutation-based evolutionary algorithms

Permutation-based encoding is used by many evolutionary algorithms dealing with combinatorial optimization problems. An important aspect of the evolutionary search process refers to the recombination process of existing individuals in order to generate ...
Empirical Analysis of Crossover-Based Evolutionary Algorithms on Rugged Landscape
GECCO '23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation

The crossover is considered as an essential component of the evolutionary algorithms. There exist different ways of how to use it, and in this paper we compare two approaches commonly used in pseudo-Boolean optimization, the classic approach of (μ + 1)...

Comments

Information & Contributors

Information

Published In

GECCO '05: Proceedings of the 7th annual workshop on Genetic and evolutionary computation

June 2005

431 pages

ISBN:9781450378000

DOI:10.1145/1102256

Conference Chair:
Franz Rothlauf
University of Mannheim, Germany

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 June 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

GECCO05

Sponsor:

SIGEVO

GECCO05: Genetic and Evolutionary Computation Conference

June 25 - 26, 2005

D.C., Washington

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
331
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yoon YKim Y(2013)Geometricity of genetic operators for real-coded representationApplied Mathematics and Computation10.1016/j.amc.2013.05.018219:23(10915-10927)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.1016/j.amc.2013.05.018
Moraglio AMoore J(2012)Geometry of evolutionary algorithmsProceedings of the 14th annual conference companion on Genetic and evolutionary computation10.1145/2330784.2330942(1317-1344)Online publication date: 7-Jul-2012
https://dl.acm.org/doi/10.1145/2330784.2330942
Yoon YKim YMoraglio AMoon B(2012)Quotient geometric crossovers and redundant encodingsTheoretical Computer Science10.1016/j.tcs.2011.08.015425(4-16)Online publication date: 1-Mar-2012
https://dl.acm.org/doi/10.1016/j.tcs.2011.08.015
Pitzer EAffenzeller M(2012)A Comprehensive Survey on Fitness Landscape AnalysisRecent Advances in Intelligent Engineering Systems10.1007/978-3-642-23229-9_8(161-191)Online publication date: 2012
https://doi.org/10.1007/978-3-642-23229-9_8
Moraglio ALanzi P(2011)Geometry of evolutionary algorithmsProceedings of the 13th annual conference companion on Genetic and evolutionary computation10.1145/2001858.2002144(1439-1468)Online publication date: 12-Jul-2011
https://dl.acm.org/doi/10.1145/2001858.2002144
Fournier HTeytaud O(2011)Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign PatternsAlgorithmica10.1007/s00453-010-9391-359:3(387-408)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1007/s00453-010-9391-3
Toussaint G(2010)Computational geometric aspects of rhythm, melody, and voice-leadingComputational Geometry: Theory and Applications10.1016/j.comgeo.2007.01.00343:1(2-22)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.1016/j.comgeo.2007.01.003
Moraglio ADi Chio CTogelius JPoli R(2008)Geometric particle swarm optimizationJournal of Artificial Evolution and Applications10.1155/2008/1436242008:S1(1-14)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.1155/2008/143624
Gustafson SVanneschi L(2008)Crossover-Based Tree Distance in Genetic ProgrammingIEEE Transactions on Evolutionary Computation10.1109/TEVC.2008.91599312:4(506-524)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.1109/TEVC.2008.915993
Czogalla JFink A(2008)On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling ProblemMetaheuristics for Scheduling in Industrial and Manufacturing Applications10.1007/978-3-540-78985-7_3(61-89)Online publication date: 2008
https://doi.org/10.1007/978-3-540-78985-7_3
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Escaping Local Optima with Diversity Mechanisms and Crossover

Best-order crossover for permutation-based evolutionary algorithms

Empirical Analysis of Crossover-Based Evolutionary Algorithms on Rugged Landscape