Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
How to solve it : modern heuristics
Michalewicz Z., Fogel D., Springer-Verlag New York, Inc., Secaucus, NJ, 2004. Type: Book (9783540224945)
Date Reviewed: Apr 21 2005

This is an outstanding book. It takes the reader close to the current knowledge frontier in the field of the heuristics of optimization. Following in the footsteps of Polya’s book [1], this book has seen fantastic acceptance, from the worlds of both mathematics and computer science.

It is a compendium of approaches for tackling problems as we encounter them in mathematics. The first half of the book is on search heuristics, covering methods such as traditional searches (exhaustive search, greedy algorithms, divide and conquer, dynamic programming, A*, and so on), methods to escape local optima (simulated annealing and tabu search), and evolutionary algorithms. The second half of the book covers more advanced areas, such as constraint handling, neural networks, and fuzzy systems.

This second edition of the book contains two new chapters, one on coevolutionary systems, and one on multicriterial decision making. Some new puzzles have also been added, and various subchapters have been revised. The appendices provide a good introduction to the background information on probability theory and statistics used throughout the book, as well as projects for further exploration. Integrated into the discourse is a series of problems and puzzles to challenge the reader. The book’s writing style is lively and educational, and this makes it extremely interesting and readable, something that is very hard to find in many technical books.

The only apparent shortcoming of the book is its lack of analysis of the running time complexity of each algorithm presented. Also, the treatment of multiobjective genetic algorithms is rather obsolete, since the field has already evolved.

The book is intended for students and practitioners. Anyone who reads and understands the material in the book will be armed with the most powerful problem solving tools currently known. In terms of classroom use, the book is an excellent choice for a course on heuristics or optimization, and could be used in advanced undergraduate classes, or in a graduate class.

One of the most comprehensive views of modern techniques in problem solving is provided in this book. It is written to be read and understood by both students and experienced researchers in the field. It is much more than a simple description of techniques, one after the other; it challenges the reader to think creatively. Undoubtedly, this is a must-read and must-have for anyone engaged in the art of problem solving.

Reviewer:  Dimitrios Katsaros Review #: CR131166 (0603-0253)
1) Polya, G. How to solve it. Princeton University Press, Princeton, NJ, 2004.
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Heuristic Methods (I.2.8 ... )
 
 
Dynamic Programming (I.2.8 ... )
 
 
Optimization (G.1.6 )
 
Would you recommend this review?
yes
no
Other reviews under "Heuristic Methods": Date
Embedding decision-analytic control in a learning architecture
Etzioni O. (ed) Artificial Intelligence 49(1-3): 129-159, 1991. Type: Article
Sep 1 1992
The complexity of the Lin-Kernighan heuristic for the traveling salesman problem
Papadimitriou C. SIAM Journal on Computing 21(3): 450-465, 1992. Type: Article
May 1 1993
Toward combining empirical and analytical methods for inferring heuristics
Mitchell T. (ed)  Artificial and human intelligence (, Lyon, France,1031984. Type: Proceedings
Aug 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy