๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Genetic Algorithms + Data Structures = Evolution Programs

โœ Scribed by Zbigniew Michalewicz


Publisher
Springer
Year
1996
Tongue
English
Edition
3
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


Genetic algorithms are founded upon the principle of evolution, i.e., survival of the fittest. Hence evolution programming techniques, based on genetic algorithms, are applicable to many hard optimization problems, such as optimization of functions with linear and nonlinear constraints, the traveling salesman problem, and problems of scheduling, partitioning, and control. The importance of these techniques is still growing, since evolution programs are parallel in nature, and parallelism is one of the most promising directions in computer science. The book is self-contained and the only prerequisite is basic undergraduate mathematics. This third edition has been substantially revised and extended by three new chapters and by additional appendices containing working material to cover recent developments and a change in the perception of evolutionary computation.


๐Ÿ“œ SIMILAR VOLUMES


Genetic Algorithms + Data Structures = E
โœ Zbigniew Michalewicz ๐Ÿ“‚ Library ๐Ÿ“… 1998 ๐Ÿ› Springer-Verlag ๐ŸŒ English

Zbigniew Michalewicz's Genetic Algorithms + Data Structures = Evolution Programs has three sections. The first section is a straightforward introduction to genetic algorithms. In the second section, Michalewicz describes how to apply genetic algorithms to numerical optimization. Michalewicz, who is