Cycle Mutation: Evolving Permutations via Cycle Induction
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 larges...
Main Author: | Vincent A. Cicirello |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-05-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/12/11/5506 |
Similar Items
-
Local Fitness Landscape Exploration Based Genetic Algorithms
by: Rahul Dubey, et al.
Published: (2023-01-01) -
Research on Morphological Innovation Design of Industrial Products Based on Combinatorial Genetic Algorithm
by: Han Yan
Published: (2024-01-01) -
A New Frequency Analysis Operator for Population Improvement in Genetic Algorithms to Solve the Job Shop Scheduling Problem
by: Monique Simplicio Viana, et al.
Published: (2022-06-01) -
An efficient optimizer for the 0/1 knapsack problem using group counseling
by: Yazeed Yasin Ghadi, et al.
Published: (2023-04-01) -
An Interactive Estimation of the Distribution Algorithm Integrated with Surrogate-Assisted Fitness
by: Zhanzhou Qiao, et al.
Published: (2023-10-01)