Chaos propagation in genetic algorithms: An optimal transport approach
Bulletin of the London Mathematical Society · 2026-03 · 58 (3)
DOI: 10.1112/blms.70333 ↗Kurz gefasst
Fachartikel in der Zeitschrift Bulletin of the London Mathematical Society, online erschienen am 11.03.2026. Verfasst von Giacomo Borghi. Die Arbeit nennt 41 Literaturangaben.
Abstract (Originalsprache)
Genetic algorithms are high‐level heuristic optimization methods that enjoy great popularity thanks to their intuitive description, flexibility, and, of course, effectiveness. The optimization procedure is based on the evolution of possible solutions through three mechanisms: selection, mutation, and crossover. In this paper, we look at the algorithm as an interacting particle system and show that it is described by a Boltzmann‐type equation in the many‐particle limit. Specifically, we prove a propagation of chaos result using a technique that leverages the optimal transport formulation of the bounded Lipschitz norm and naturally incorporates the crossover mechanism into the analysis. The convergence admits a rate with respect to the number of particles, corresponding to the optimal rate in the Wasserstein‐1 distance.
Zitieren
APA
Borghi, G. (2026). Chaos propagation in genetic algorithms: An optimal transport approach. Bulletin of the London Mathematical Society, 58(3). https://doi.org/10.1112/blms.70333
Vancouver
Borghi G. Chaos propagation in genetic algorithms: An optimal transport approach. Bulletin of the London Mathematical Society. 2026;58(3). doi:10.1112/blms.70333
BibTeX
@article{Borghi2026,
author = {Borghi, Giacomo},
title = {Chaos propagation in genetic algorithms: An optimal transport approach},
journal = {Bulletin of the London Mathematical Society},
year = {2026},
volume = {58},
number = {3},
doi = {10.1112/blms.70333}
}
EUVIMED