On the mean convergence time of multi-parent genetic algorithms without selection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3630 LNAI, Issue , 2005, Pages 403-412

  Ting, Chuan Kang ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; CORRELATION THEORY; GENETIC ALGORITHMS; MARKOV PROCESSES; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; PROBLEM SOLVING;

GENETIC DRIFTS; MEAN CONVERGENCE; MEAN CONVERGENCE TIME; MULTI-PARENT GENETIC ALGORITHMS (MPGAS);

BIODIVERSITY;

EID: 33646014727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11553090_41     Document Type: Conference Paper

References (15)

1. M. Abramowitz and I.A. Stegun, editors. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover Publications, 1972. ninth Dover printing.
2. H. Asoh and H. Mühlenbein. On the mean convergence time of evolutionary algorithms without selection and mutation. In Parallel Problem Solving from Nature PPSN III, volume 866 of LNCS, pages 88-97, Berlin, 1994. Springer.
3. P. Brémaud. Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues. Springer Verlag, 1999.
4. T.E. Davis and J.C. Principe. A markov chain framework for the simple genetic algorithm. Evolutionary Computation, 1(3):269-288, 1993.
5. A.E. Eiben. Multiparent recombination in evolutionary computing. In Advances in Evolutionary Computing, pages 175-192. Springer, 2002.
6. A.E. Eiben, P.-E. Rau'e, and Zs. Ruttkay. Genetic algorithms with multi-parent recombination. In Parallel Problem Solving from Nature - PPSN III, volume 866 of LNCS, pages 78-87. Springer, 1994.
7. A.E. Eiben and C.H.M. van Kemenade. Diagonal crossover in genetic algorithms for numerical optimization. Journal of Control and Cybernetics, 26(3):447-465, 1997.
8. D.E. Goldberg and P. Segrest. Finite markov chain analysis of genetic algorithms. In Proceedings of the end International Conference on Genetic Algorithms and their Applications, pages 1-8. Lawrence Erlbaum Associates, 1987.
9. D.L. Hartl and A.G. Clark. Principles of Poppulation Genetics. Sinauer Associates, 1 edition, 1989.
10. J. Horn. Finite markov chain analysis of genetic algorithms with niching. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 110-117. Morgan Kaufmann Publishers, 1993.
11. A.E. Nix and M.D. Vose. Modeling genetic algorithms with markov chains. Annals of Mathematics and Artificial Intelligence, 5:78-88, 1992.
12. A. Papoulis and S.U. Pillai. Probability, Random Variables, and Stochastic Processes. McGraw-Hill, New York, NY, USA, 4 edition, 2002. ISBN 0-07-048477-5.
13. G. Rudolph. Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks, 5(1):96-101, 1994.
14. C.A. Schippers. Multi-parent scanning crossover and genetic drift. In Theoretical Aspects of Evolutionary Computing, pages 307-330. Springer, 2001.
15. S. Tsutsui and A. Ghosh. A study on the effect of multi-parent recombination in real coded genetic algorithms. In Proceedings of International Conference on Evolutionary Computation, pages 828-833, 1998.