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
AJAS · 2018
Stochastic Dynamics in Non-Equilibrium Thermodynamic Systems
CSEF · 2014
Balancing Diversity and Fitness while Evolving Neural Networks
ISEF · 2017
Genetic Algorithms and Sorting Data
AJAS · 2020
Knowledge as Power: The Role of Microstate Information in Thermodynamic Free Energy
CSEF · 2003
Evolution of Data: The Effect of Mutation Functions on the Growth of a Computer Generated Population
ISEF · 2025
Sticky States and the Adhesion Effect: A Novel Model of Directional Evolution Without Darwinian Selection
CSEF · 2017
Evolving Near Optimal Solutions to Computationally Hard Problems Using Natural Selection
ISEF · 2017
Maze Solving Optimization through Genetic Programming
Closest projects by meaning, across every fair and year in the corpus.
Browse more like this
Source: Regeneron International Science and Engineering Fair