A Distance Between Populations for n-Points Crossover in Genetic Algorithms

2017/07/03 by Mauro Castelli, Gianpiero Cattaneo, Castelli, Mauro +5
Computer Science · #Advanced Multi-Objective Optimization Algorithms #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #Metaheuristic Optimization Algorithms Research #Neural and Evolutionary Computing (cs.NE) #cs.NE

paper · pdf · doi:10.48550/arxiv.1707.00451

arxiv created 2017/07/03 · openalex publication_date 2017/07/03 · arxiv updated 2017/07/04 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28

Abstract

Genetic algorithms (GAs) are an optimization technique that has been successfully used on many real-world problems. There exist different approaches to their theoretical study. In this paper we complete a recently presented approach to model one-point crossover using pretopologies (or Cech topologies) in two ways. First, we extend it to the case of n-points crossover. Then, we experimentally study how the distance distribution changes when the number of crossover points increases.

Related

• Amazing geometry of genetic space or are genetic algorithms convergent?
• Hierarchical Crossover and Probability Landscapes of Genetic Operators
• A Novel Crossover Operator for Genetic Algorithms: Ring Crossover
• How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms
• Achieving Tight O(4^k) Runtime Bounds on Jump_k by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity