Convergence of nomadic genetic algorithm on benchmark mathematical functions

作者: S. Siva Sathya , M.V. Radhika

DOI: 10.1016/J.ASOC.2012.11.011

关键词:

摘要: Nomadic genetic algorithm is a type of multi-population migration based that gives equal importance to low fit individuals and adaptively chooses its parameters. It has been applied several real life applications found perform well compared other algorithms. This paper exploits the working nomadic (NGA) for benchmark mathematical functions compares it with standard algorithm. To compare performance GA (SGA), prominent used in optimization are results proved NGA outperforms SGA terms convergence speed better optimized values.

参考文章(26)
Martina Gorges-Schleuter, Comparison of Local Mating Strategies in Massively Parallel Genetic Algorithms. parallel problem solving from nature. pp. 559- 568 ,(1992)
John J. Grefenstette, Michael R. Leuze, Chrisila B. Pettey, A parallel genetic algorithm international conference on genetic algorithms. pp. 155- 161 ,(1987)
D. H. Ackley, An empirical study of bit vector function optimization Genetic Algorithms and Simulated Annealing. ,(1987)
J. Kauth, Darrell Whitley, Genitor: a different genetic algorithm ,(1988)
William M. Spears, Simple Subpopulation Schemes ,(1998)
Reiko Tanese, Distributed Genetic Algorithms international conference on genetic algorithms. pp. 434- 439 ,(1989)
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