Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Back T. — Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms
Back T. — Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms

Автор: Back T.

Аннотация:

In comparing this book with, say Goldberg's "Genetic Algorithms..." (may be the most popular genetic algorithms text), this book reads more like a German habilitation thesis (which I imagine it may have served as such), where as Goldberg's book seems more of a light introduction for the mathematically uninitiated. Indeed, Back's book seems quite scholarly with lots of useful references, and gives a good introduction to not only genetic algorithms, but also to evolutionary strategies (a paradigm that is most applicable to Euclidean-type search spaces) and evolutionary programming
(simular to ES and not to be confused with genetic programming).

I found Chapters 1 and 2 quite good, in that Chapter 1 presented the biological motivations for evolutionary computing along with a brief introduction to the theory of computation and computational complexity, while Chapter 2 gave a very good introduction to the above-mentioned evolutionary computing paradigms. The remainder of the book reads more like a report on the author's experiments in evolutionary computing.

It is important to note that Goldberg's book does not cover Evolutionary Strategies, which I have found to be a more fruitful approach since it is specifically designed for Euclidean space where many if not most interesting optimization problems are formulated in.

Finally, I offer bit of advice for those who plan to read through this book. Some of the definitions are stated with such generality that they seem very opaque upon first reading. It is very important to understand them, so do not give up! Once the defintions are understood, the algorithms will seem much easier to comprehend. In fact, the algorithms have a very simple outline:
i) initialize population
ii) while the terminating condition is not yet met: recombine to form new population members, mutate the population members, select the most fit population members to form the next generation.
The partial analyses provided for the algorithms can be skipped on first reading.


Язык: en

Рубрика: Разное/

Статус предметного указателя: Неизвестно

ed2k: ed2k stats

Год издания: 1996

Количество страниц: 160

Добавлена в каталог: 08.11.2017

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2021
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте