Next Article in Journal
Improving Particle Swarm Optimization Analysis Using Differential Models
Next Article in Special Issue
A Stigmergy-Based Differential Evolution
Previous Article in Journal
Deep Learning Application in Dental Caries Detection Using Intraoral Photos Taken by Smartphones
Article

Cycle Mutation: Evolving Permutations via Cycle Induction

Computer Science, Stockton University, 101 Vera King Farris Dr, Galloway, NJ 08205, USA
Academic Editor: Giancarlo Mauri
Appl. Sci. 2022, 12(11), 5506; https://doi.org/10.3390/app12115506
Received: 6 May 2022 / Revised: 18 May 2022 / Accepted: 27 May 2022 / Published: 29 May 2022
(This article belongs to the Special Issue Evolutionary Computation: Theories, Techniques, and Applications)
Evolutionary algorithms solve problems by simulating the evolution of a population of candidate solutions. We focus on evolving permutations for ordering problems such as the traveling salesperson problem (TSP), as well as assignment problems such as the quadratic assignment problem (QAP) and largest common subgraph (LCS). We propose cycle mutation, a new mutation operator whose inspiration is the well-known cycle crossover operator, and the concept of a permutation cycle. We use fitness landscape analysis to explore the problem characteristics for which cycle mutation works best. As a prerequisite, we develop new permutation distance measures: cycle distance, k-cycle distance, and cycle edit distance. The fitness landscape analysis predicts that cycle mutation is better suited for assignment and mapping problems than it is for ordering problems. We experimentally validate these findings showing cycle mutation’s strengths on problems such as QAP and LCS, and its limitations on problems such as the TSP, while also showing that it is less prone to local optima than commonly used alternatives. We integrate cycle mutation into the open source Chips-n-Salsa library, and the new distance metrics into the open source JavaPermutationTools library. View Full-Text
Keywords: combinatorial optimization; evolutionary algorithms; fitness distance correlation; fitness landscape analysis; genetic algorithms; mutation; permutation cycles; permutation distance combinatorial optimization; evolutionary algorithms; fitness distance correlation; fitness landscape analysis; genetic algorithms; mutation; permutation cycles; permutation distance
Show Figures

Figure 1

MDPI and ACS Style

Cicirello, V.A. Cycle Mutation: Evolving Permutations via Cycle Induction. Appl. Sci. 2022, 12, 5506. https://doi.org/10.3390/app12115506

AMA Style

Cicirello VA. Cycle Mutation: Evolving Permutations via Cycle Induction. Applied Sciences. 2022; 12(11):5506. https://doi.org/10.3390/app12115506

Chicago/Turabian Style

Cicirello, Vincent A. 2022. "Cycle Mutation: Evolving Permutations via Cycle Induction" Applied Sciences 12, no. 11: 5506. https://doi.org/10.3390/app12115506

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop