Genetic Algorithms + Data Structures = Evolution Programs
26 ratings by Goodreads
Language: English
Published by Springer, 1996
- Hardcover
- Used

Seller: Marlton Books, Bridgeton, NJ, U.S.A.Marlton Books
5-star seller
AbeBooks seller since July 1, 2025
Hardcover
Condition: Used - Very good
US$ 9.37
US$ 3.00 shipping
Ships within U.S.A.
Quantity: 1 available
Add to basketFree 30-day returns
Item description from seller
Has some wear and creases. Has a remainder mark. hardcover Used - Very Good 1996.
Seller Inventory # AB-015996
- Title
- Genetic Algorithms + Data Structures = Evolution Programs
- Author
- Michalewicz, Zbigniew
- Publisher
- Springer
- Publication year
- 1996
- Condition
- Very Good
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 3540606769
- ISBN 13
- 9783540606765
- Edition
- 3rd Edition
- Item weight
- 26.56 ounces
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.
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.
"Synopsis" may belong to another edition of this title.
From the Back Cover
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 aim of this book is to talk about the field of evolutionary computation in simple terms, and discuss the simplicity and elegance of its methods on many interesting test cases. The book may serve as a guide to writing an evolution program, and to making this an enjoyable experience. It is self-contained and the only prerequisite is basic undergraduate mathematics. Aimed at researchers, practitioners, and graduate students, it may serve as a text for advanced courses in computer science and artificial intelligence, operations research, and engineering. This third edition has been substantially revised and extended. Three new chapters discuss the recent paradigm of genetic programming, heuristic methods and constraint handling, and current directions of research. Additional appendices contain test functions for experiments with evolutionary techniques and discuss possible projects for use in a project-oriented course.
"About the title" may belong to another edition of this title.
Marlton Books
Bridgeton, NJ, U.S.A.
5-star seller
AbeBooks seller since July 1, 2025
Shipping rates within U.S.A.
| Item | 5 to 14 business days | 3 to 6 business days |
|---|---|---|
| First item | US$ 3.00 | US$ 7.99 |
Payment methods
Store description
Marlton Books, thousands of New books at discount prices!
Specialty
New and UsedSeller's business information
NY, U.S.A.
Shipping terms
All items ship from the United States.