Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/autre/evolutionary-computation-1/descriptif_4098868
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=4098868

Evolutionary Computation 1 Basic Algorithms and Operators

Langue : Anglais

Coordonnateur : Baeck Thomas

Couverture de l’ouvrage Evolutionary Computation 1
The field of evolutionary computation is expanding dramatically, fueled by the vast investment that reflects the value of applying its techniques. Culling material from the Handbook of Evolutionary Computation, Evolutionary Computation 1: Basic Algorithms and Operators contains up-to-date information on algorithms and operators used in evolutionary computing. This volume discusses the basic ideas that underlie the main paradigms of evolutionary algorithms, evolution strategies, evolutionary programming, and genetic programming. It is intended to be used by individual researchers, teachers, and students working and studying in this expanding field.
PART 1 WHY EVOLUTIONARY COMPUTATION? 1. Introduction to evolutionary computation. 2. Possible applications of evolutationary computation. 3. Advantages (and disadvantages) of evolutionary computation over other approaches. PART 2. EVOLUTIONARY COMPUTATION: THE BACKGROUND. 4. Principles of evolutionary processes. 5. Principles of genetics. 6. A history of evolutionary computation. PART 3 EVOLUTIONARY ALGORITHMS AND THEIR STANDARD INSTANCES. 7. Introduction to evolutionary algorithms. 8. Genetic algorithms. 9. Evolution strategies. 10. Evolutionary programming. 11. Derivative methods in genetic programming. 12. Learning classifier systems. 13. Hybrid methods. PART 4. REPRESENTATIONS. 14. Introduction to representations. 15. Binary strings. 16. Real-valued vectors. 17. Permutations. 18. Finite-state representations. 19. Parse trees. 20. Guidelines for a suitable encoding. 21. Other representations. PART 5. SELECTION. 22. Introduction to selection. 23. Proportionary selection and sampling algorithms. 24. Tournament selection. 25. Rank-based selection. 26. Boltzmann selection. 27. Other selection methods. 28. Generation gap methods. 29. A comparison of selection mechanisms. 30. Interactive evolution. PART 6. SEARCH OPERATORS. 31. Introduction to search operators. 32. Mutation operators. 33. Recombination. 34. Other operators. Index.
Undergraduate
Thomas Baeck, D.B Fogel, Z Michalewicz