Entropy in Evolutionary Algorithms - Statistical Mechanics Bearing Insight into Evolution
Overview
Genetic algorithms (GAs) are an optimization technique inspired by natural selection. GAs have yielded good results in certain practical problems, yet there is still more to be understood about their behavior on a theoretical level. One approach is to look at the evolutionary process from the point of view of statistical mechanics, and interpreting jumps in fitness as phase transitions. Toward this goal we examine the behavior of entropy in a GA that optimizes a simple function. We find that entropy increases as a new species diversifies, but its upper bound decreases with most phase transitions (which correspond to evolutionary steps).
Competition history
- ISEF 2021
Resources
Related projects
ISEF · 2017
Genetic Algorithms and Sorting Data
ISEF · 2025
Sticky States and the Adhesion Effect: A Novel Model of Directional Evolution Without Darwinian Selection
ISEF · 2017
Maze Solving Optimization through Genetic Programming
ISEF · 2018
Modeling the Emergence of Epistatic Gene Combinations as a Phenotypic Function of Evolution
ISEF · 2023
Modeling Viral Evolution and Epidemic Simulation Using Genetic Algorithms
ISEF · 2026
An Entropy-Driven Framework for Early Prediction of Phase Transitions in Strategic and Combinatorial Systems
CWSF · 2026
EvoNash: Accelerating Convergence to Nash Equilibrium
ISEF · 2026
Entropy Engine: Utilizing Non-Deterministic Electron Cascade Dynamics for Cryptographically Secure Password Generation
Closest projects by meaning, across every fair and year in the corpus.
Browse more like this
Source: Regeneron International Science and Engineering Fair