The parameter-less genetic algorithm in practice

The parameter-less genetic algorithm was introduced a couple of years ago as a way to simplify genetic algorithm operation by incorporating knowledge of parameter selection and population sizing theory in the genetic algorithm itself. This paper shows how that technique can be used in practice by applying it to a network expansion problem. The existence of the parameter-less genetic algorithm stresses the fact that some problems need more processing power than others. Such observation leads to the development of a problem difficulty measure which is also introduced in this paper. The measure can be useful for comparing the difficulty of real-world problems.

[1]  D. Goldberg,et al.  BOA: the Bayesian optimization algorithm , 1999 .

[2]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  E. Weinberger,et al.  Correlated and uncorrelated fitness landscapes and how to tell the difference , 1990, Biological Cybernetics.

[5]  Martin Pelikan,et al.  Parameter-less Genetic Algorithm: A Worst-case Time and Space Complexity Analysis , 2000, GECCO.

[6]  David E. Goldberg,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1999, Evolutionary Computation.

[7]  Fernando G. Lobo,et al.  A parameter-less genetic algorithm , 1999, GECCO.

[8]  B. C. Brookes,et al.  Information Sciences , 2020, Cognitive Skills You Need for the 21st Century.

[9]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..

[10]  G. Harik.  Linkage Learning via Probabilistic Modeling in the ECGA , 1999 .

[11]  Dirk Thierens,et al.  Toward a Better Understanding of Mixing in Genetic Algorithms , 1993 .

[12]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[13]  Lashon B. Booker,et al.  Proceedings of the fourth international conference on Genetic algorithms , 1991 .

[14]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[15]  Bernard Manderick,et al.  The Genetic Algorithm and the Structure of the Fitness Landscape , 1991, ICGA.

[16]  Ralph E. Johnson,et al.  Frameworks = (components + patterns) , 1997, CACM.