This paper presents an adaptive selection scheme for use in evolutionary algorithms (EAs). The proposed algorithm adjusts the stochastic noise level in the determination of the mating pool in order to regulate the selection pressure. This eliminates the fitness scaling problem and allows optimization of the selection pressure throughout the learning phase, overcoming the major pitfalls of most popular EA selection procedures. Experimental evidence is given to prove the superior performance of the proposed technique compared with conventional EA procedures. The results also highlight how the application of windowing techniques to the roulette wheel procedure can increase the likelihood of premature convergence.
ChiongR.Nature-inspired algorithms for optimisation in Studies in Computational Intelligence series (Ed. ChiongR.), vol. 193, 2009 (Springer, Heidelberg, Germany).
2.
De JongK. A.Evolutionary computation: a unified approach2006(MIT Press, Cambridge, Massachusetts).
3.
RechenbergI.Cybernetic solution path of an experimental problem, in Library Translation no.??;hairsp;1122, 1965 (Royal Aircraft Establishment, Farnborough, UK).
FogelL. J.OwensA. J.WalshM. J.Artificial intelligence through simulated evolution1966(Wiley, New York).
6.
FogelD. B.An analysis of evolutionary programming. In Proceedings of the First Annual Conference on Evolutionary Programming, La Jolla, CA, 21–22 February 1992, Edited by FogelD. B.AtmarJ. W. (Evolutionary Programming Society, San Diego, CA). 1992, pp[. 43–45.
7.
HollandJ. H.Adaptation in natural and artificial systems1975(University of Michigan Press, Ann Arbor, Michigan).
8.
De JongK. A.An analysis of the behaviour of a class of genetic adaptive systems. PhD Thesis, University of Michigan, 1975.
9.
GoldbergD. E.DebK.A comparative analysis of selection schemes used in genetic algorithms. In Foundations of genertic algorithms (Ed. RawlinsG.), 1991 (Morgan Kaufmann Publishers, San Mateo, California, pp. 69–93.
10.
AffenzellerM.WinklerS.WagnerS.BehamA.Genetic algorithms and genetic programming: Modern concepts and practical applications2009 (Chapman Hall/CRC, Boca Raton, Florida).
11.
PhamD. T.CastellaniM.Outline of a new evolutionary algorithm for fuzzy systems learning. Proc. IMechE, Part C: J. Mechanical Engineering Science2002, 216(C5), 557–570. DOI: 10.1243/0954406021525340.
12.
GrefenstetteJ. J.Optimisation of control parameters for genetic algorithms. IEEE Trans. Syst., Man Cybern., 1986, 16(1), 122–128.
13.
BakerJ. E.Adaptive selection methods for genetic algorithms. In Proceedings of the First International Conference on Genetic Algorithms and their Applications, Pittsburgh, PA, 24–26 July 1985, Edited by GreffenstetteJ. J. (Lawrence Erlbaum Associates, Hillside, NJ), pp. 100–111.
14.
EibenA. E.SchutM. C.de WildeA. R.Is self-adaptation of selection pressure and population size possible? - A case study. Lect. Notes Comput. Sci.2006, 4193, 900–909.
15.
GrefenstetteJ. J.Predictive models using fitness distributions of genetic operators. In Foundations of gas 3 (Eds WhitleyL. D.VoseM.D.), 1994 (Morgan Kaufmann Publishers, San Francisco, California, pp. 139–161.
16.
CastellaniM.Neural networks training using evolutionary programming. MSc Thesis, University of Wales, Cardiff School of Engineering, 1995.
17.
DiwekarU.Introduction to applied optimization, 2nd edition2008 (Springer, New York).
18.
DukkipatiA.MurtyM. N.BhatnagarS.Cauchy annealing schedule: an annealing schedule for Boltzmann selection scheme in evolutionary algorithms. In Proceedings of the 2004 Congress on Evolutionary Computation (CEC2004), Portland OR, June 19–23 2004, Edited by GreenwoodG. (IEEE Press, Piscataway, NJ), vol. 1, pp. 55–62.
