A formalism recently introduced by Prugel-Bennett and Shapiro uses the methods of statistical mechanics to model the dynamics of genetic algorithms. To be of more general interest than the test cases they consider. In this paper, the technique is applied to the subset sum problem, which is a combinatorial optimization problem with a strongly non-linear energy (fitness) function and many local minima under single spin flip dynamics. It is a problem which exhibits an interesting dynamics, reminiscent of stabilizing selection in population biology. The dynamics are solved under certain simplifying assumptions and are reduced to a set of difference equations for a small number of relevant quantities. The quantities used are the population's cumulants, which describe its shape, and the mean correlation within the population, which measures the microscopic similarity of population members. Including the mean correlation allows a better description of the population than the cumulants alone would provide and represents a new and important extension of the technique. The formalism includes finite population effects and describes problems of realistic size. The theory is shown to agree closely to simulations of a real genetic algorithm and the mean best energy is accurately predicted.
[1]
Oliver Vornberger,et al.
Enumerative vs. Genetic Optimization: Two Parallel Algorithms for the Bin Packing Problem
,
1992,
Data Structures and Efficient Algorithms.
[2]
Prügel-Bennett,et al.
Analysis of genetic algorithms using statistical mechanics.
,
1994,
Physical review letters.
[3]
P. Garrett,et al.
Basic complex analysis
,
2022
.
[4]
Kalyanmoy Deb,et al.
Analyzing Deception in Trap Functions
,
1992,
FOGA.
[5]
David E. Goldberg,et al.
Genetic Algorithms in Search Optimization and Machine Learning
,
1988
.
[6]
Bruce Tidor,et al.
Increased Flexibility in Genetic Algorithms: the Use of variable Boltzmann Selective pressure to control Propagation
,
1992,
Computer Science and Operations Research.
[7]
David S. Johnson,et al.
Computers and Intractability: A Guide to the Theory of NP-Completeness
,
1978
.
[8]
A. Prügel-Bennett,et al.
The dynamics of a genetic algorithm for simple random Ising systems
,
1997
.
[9]
Adam Prügel-Bennett,et al.
A Statistical Mechanical Formulation of the Dynamics of Genetic Algorithms
,
1994,
Evolutionary Computing, AISB Workshop.