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 optimisation problems, such as optimisation 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, 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.
Cover has a few light wear marks; bumping to top of spine and at several points on cover edges, more noticeably to bottom of front edge.
A few light soiling marks to text block edges.
None of this detracts from the wealth of information within nor the excellent appearance of the book as a whole, which is near fine. Tight text block, glossy laminated boards, illustrated with a rather appealing fractal design.
Clear text, comprising informative text, b/w diagrams, graphs, charts and elegant formulae.