SGA search dynamics on second order functions (1998) [2 citations — 2 self]
by Bart Naudts, Alain Verschoren
Artificial Evolution 97
http://islab.ruca.ua.ac.be/bart/../publications/ea97.ps.gz
Add To MetaCart
Abstract:
heuristic, we are able to analyze the behavior of the simple genetic algorithm on second order functions, whose optimization is shown to be an NP-equivalent problem. It appears that both algorithms approach these fitness functions in the same, intuitive way: they start by deciding the obvious and most probable, and then they proceed to make more difficult decisions. Useful information about the optimization problem is, among others, provided by statistical physics: lattice gases can be modeled as second order functions. 1
Citations
| 1588 | Computational Complexity – Papadimitriou - 1994 |
| 257 | Interacting Particle Systems – Liggett - 1985 |
| 128 | Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms – Jones, Forrest - 1995 |
| 85 | Epistasis Variance: A Viewpoint on GA-Hardness", in Foundations of Genetic Algorithms – Davidor - 1991 |
| 78 | Adaptation on rugged fitness landscapes – Kauffman - 1989 |
| 23 | Integer Programming – Salkin - 1975 |
| 6 | Epistasis as a Basic Concept in Formal Landscape Analysis – Naudts, Suys, et al. - 1997 |
| 4 | Mathematical statistical mechanics – Thompson - 1972 |
| 1 | Second Order Functions for the SGA – Naudts, Verschoren - 1997 |
| 1 | Network Balancing: SGA versus Hillclimber – Naudts - 1998 |
| 1 | A Theoretical Approach to GA-Hardness – Naudts - 1998 |
