Real-Parameter Genetic Algorithms for Finding Multiple Optimal Solutions in Multi-modal Optimization

作者: Pedro J. Ballester , Jonathan N. Carter

DOI: 10.1007/3-540-45105-6_86

关键词:

摘要: The aim of this paper is to identify Genetic Algorithms (GAs) which perform well over a range continuous and smooth multimodal real-variable functions. In our study, we focus on testing GAs combining three classes genetic operators: selection, crossover replacement. approach followed time-constrained thus stopping criterion fixed number generations. Results show that with random selection parents crowding replacement are robust optimizers. By contrast, tournament poorly in comparison.

参考文章(13)
Shigenobu Kobayashi, Isao Ono, A Real Coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distributed Crossover. Proc. 7th ICGA, 1997. pp. 246- 253 ,(1997)
Georges R. Harik, Finding Multimodal Solutions Using Restricted Tournament Selection international conference on genetic algorithms. pp. 24- 31 ,(1995)
Kalyanmoy Deb, Ram Bhushan Agrawal, Simulated Binary Crossover for Continuous Search Space. Complex Systems. ,vol. 9, ,(1995)
Samir Agrawal, Kalyanmoy Deb, Understanding Interactions among Genetic Algorithm Parameters. FOGA. pp. 265- 286 ,(1998)
Larry J. Eshelman, J. David Schaffer, Real-Coded Genetic Algorithms and Interval-Schemata foundations of genetic algorithms. ,vol. 2, pp. 187- 202 ,(1993) , 10.1016/B978-0-08-094832-4.50018-0
David E. Goldberg, Kalyanmoy Deb, A Comparative Analysis of Selection Schemes Used in Genetic Algorithms Foundations of Genetic Algorithms. ,vol. 1, pp. 69- 93 ,(1991) , 10.1016/B978-0-08-050684-5.50008-2
Ole J Mengshoel, David E Goldberg, Probabilistic Crowding: Deterministic Crowding with Probabilistic Replacement genetic and evolutionary computation conference. pp. 409- ,(1999)
Richard K. Belew, William E. Hart, Optimising an Arbitrary Function is Hard for the Genetic Algorithm. ICGA. pp. 190- 195 ,(1991)