GA performance distributions and randoml
β
B. Naudts; L. Schoofs
π
Article
π
2002
π
Elsevier Science
π
English
β 183 KB
We investigate the variable performance of a genetic algorithm (GA) on randomly generated binary constraint satisfaction problem instances which occur near the phase transition from soluble to non-soluble. We ΓΏrst carry out a conventional landscape analysis and observe, next to a number of common fe