Evolutionary computation. 1. Basic algorithms and operators (Q2709288)

The book Evolutionary Computation 1: Basic Algorithms and Operators is the first of two volumes based in the original handbook of evolutionary computation edited by the same authors (1997; Zbl 0883.68001). This new volume contains extended material and provides basic information on evolutionary algorithms. The idea of evolutionary computation has been to make use of the powerful process of natural evolution as a problem solving paradigms by simulating it in a laboratory or on a computer. The first ideas and mainstream methods were developed in the 1950s and 1960s. The progress in the theory since 1990 confirms the strengths of the studied algorithms as well as their limitations. This book provides an interesting reference for theorists, teachers, and practitioners also. It covers the paradigms of evolutionary computation and its biological background. It contains the following parts (34 chapters):NEWLINENEWLINENEWLINEPart 1: Why Evolutionary Computation? (Introduction, applications, advantages and disadvantages of evolutionary computation over other approaches), Part 2: Evolutionary Computation: The Background (Principles and history), Part 3: Evolutionary Algorithms and their Standard Instances (General outline of evolutionary algorithms, genetic algorithms, evolution strategies, evolutionary programming and genetic programming, learning, and hybrid methods), Part 4: Representations (for instance binary strings, real-valued vectors, finite-state representations, and parse trees), Part 5: Selection (among others tournament selection, rank-based selection, Boltzmann Selection, and generation gap methods), Part 6: Search Operators (mutation operators, recombination, and other operators).NEWLINENEWLINENEWLINESeveral interesting references are given by the 24 authors at the end of each of the 34 chapters.