How to Solve It: Modern Heuristics and over one million other books are available for Amazon Kindle. Learn more

Buy New

or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
Buy Used
Used - Good See details
$25.49 & this item ships for FREE with Super Saver Shipping. Details

or
Sign in to turn on 1-Click ordering.
 
   
Kindle Edition
 
   
Sell Back Your Copy
For a $10.80 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
How to Solve It: Modern Heuristics
 
 
Start reading How to Solve It: Modern Heuristics on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

How to Solve It: Modern Heuristics [Hardcover]

Zbigniew Michalewicz (Author), David B. Fogel (Author)
4.5 out of 5 stars  See all reviews (20 customer reviews)

List Price: $59.95
Price: $41.19 & this item ships for FREE with Super Saver Shipping. Details
You Save: $18.76 (31%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 11 left in stock--order soon (more on the way).
Want it delivered Tuesday, February 14? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for students on millions of items. Learn more

Formats

Amazon Price New from Used from
Kindle Edition $37.07  
Hardcover $41.19  
Paperback $48.31  
Sell Back Your Copy for $10.80
Whether you buy it used on Amazon for $21.50 or somewhere else, you can sell it back through our Book Trade-In Program at the current price of $10.80.
Used Price$21.50
Trade-in Price$10.80
Price after
Trade-in
$10.70

Book Description

December 8, 2004 3540224947 978-3540224945 Enlarged 2nd

This book is the only source that provides comprehensive, current, and correct information on problem solving using modern heuristics. It covers classic methods of optimization, including dynamic programming, the simplex method, and gradient techniques, as well as recent innovations such as simulated annealing, tabu search, and evolutionary computation. Integrated into the discourse is a series of problems and puzzles to challenge the reader. The book is written in a lively, engaging style and is intended for students and practitioners alike. Anyone who reads and understands the material in the book will be armed with the most powerful problem solving tools currently known.

This second edition contains two new chapters, one on coevolutionary systems and one on multicriterial decision-making. Also some new puzzles are added and various subchapters are revised.


Frequently Bought Together

How to Solve It: Modern Heuristics + How to Solve It: A New Aspect of Mathematical Method (Princeton Science Library) + Fifty Challenging Problems in Probability with Solutions (Dover Books on Mathematics)
Price For All Three: $60.93

Show availability and shipping details

Buy the selected items together


Editorial Reviews

Review

The March 2002 issue of ACMs Computing Reviews identifies a review of "How to Solve It" as the best review they published in 2001. The review is then reprinted in its entirety. Reviewer: H. van Dyke Parunak.
Excerpt: Like its predecessor, the new How to Solve It, combines deep mathematical insight with skilled pedagogy. Puzzle lovers will seek out the book for its insightful discussion of many intriguing brain twisters. Students of computational methods will find it an accessible but rigorous introduction to evolutionary algorithms. Teachers will learn from its expositions how to make their own subject matter clearer to their students. Polya would be honored to know that his spirit lives on in the computer age.

From the reviews of the second edition:

"This is an outstanding book. It takes the reader close to the current knowledge frontier … . The book’s writing style is lively and educational, and this makes it extremely interesting … . is intended for students and practitioners. … is an excellent choice for a course on heuristics … . One of the most comprehensive views … is provided in this book. It is written to be read and understood … . is a must-read and must-have for anyone engaged in the art of problem solving." (Dimitrios Katsaros, Computing Reviews, April, 2005)

--This text refers to an out of print or unavailable edition of this title.

Product Details

  • Hardcover: 572 pages
  • Publisher: Springer; Enlarged 2nd edition (December 8, 2004)
  • Language: English
  • ISBN-10: 3540224947
  • ISBN-13: 978-3540224945
  • Product Dimensions: 9.8 x 7 x 1.6 inches
  • Shipping Weight: 2 pounds (View shipping rates and policies)
  • Average Customer Review: 4.5 out of 5 stars  See all reviews (20 customer reviews)
  • Amazon Best Sellers Rank: #772,917 in Books (See Top 100 in Books)

More About the Authors

Discover books, learn about writers, read author blogs, and more.

 

Customer Reviews

20 Reviews
5 star:
 (15)
4 star:
 (2)
3 star:
 (2)
2 star:
 (1)
1 star:    (0)
 
 
 
 
 
Average Customer Review
4.5 out of 5 stars (20 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

70 of 72 people found the following review helpful:
5.0 out of 5 stars Outstanding and Unique Contribution, January 25, 2001
By 
William T. Scherer (Charlottesville, VA USA) - See all my reviews
This book provides a very accessible and contemporary treatment of optimization. Of particular interest is the problem solving orientation of the book as opposed to a tool-based approach to optimization and heuristics. The writing style of the book makes the book very interesting and readable - a rare thing to say about technical books! I used this book in a Master's class on Heuristics (Systems Engineering, University of Virginia) and received the most positive textbook reviews I have seen in my fifteen years of teaching. The book is an excellent choice for a course on heuristics, mathematical modeling, optimization, etc., and could be used in an advanced undergraduate class or a graduate class. In addition, the book is ideal for practitioners who may not have had exposure to modern heuristics in their education or practice, or those who want to get updated on the latest developments in the field.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


38 of 38 people found the following review helpful:
5.0 out of 5 stars extremely well written, September 9, 2004
I read this book while taking an advanced class in heuristics. I found the book to be extremely well written and very compelling to read. Although dealing with advanced topics, the authors' friendly and clear writing style makes it accessible to anyone with a CS background.

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*, etc), methods to escape local optima (simulated annealing, tabu search), and, perhaps most interesting of all, evolutionary algorithms. I later found out that these topics are typically taught in undergraduate artificial intelligence courses, an elective I never took. The second half of the book covers even more advanced areas, such as contraint-handling, neural networks, and fuzzy systems.

The authors use three recurring example applications to demonstrate each search technique: the boolean satisfiability problem (SAT), travelling salesman (TSP), and a nonlinear programming problem (NLP). I really liked the consistent use of these three examples, as they give a sense of continuity throughout the book that helps the reader compare search techniques clearly. I had of course studied the TSP problem in my undergraduate algorithms class but never in the context of such interesting approximation algorithms. In my heuristics class we had assignments to implement the TSP search problem using the Lin-Kernighan method, dynamic programming, and an evolutionary algorithm.

The written English in this book is simply outstanding and crystal-clear, which was something of a shock since I was unable to even pronounce the first author's name. The writing is in a very friendly tone with elements of humour dispersed throughout. Interestingly, in the summary chapter, there is an anecdote on the 1980s TV show Magnum PI (I even remember the mentioned scene myself), further revealing the friendly, plain-English tone of the book. Perhaps the best part of the book is that the numerical mathematical discourse is kept at a minimum (used largely for the NLP problems), so people who haven't taken calculus in ages (like me) can easily enjoy the book.

As an added bonus(!), between each chapter is a brain-teaser problem like those found in those legendary Microsoft interview questions.

My only complaint is that there is no simple analysis of the running time complexity of each algorithm, which even in its simplest form would have been a great thing to read about.

In summary, this book is an excellent read if you enjoy the topics covered. Highly recommended.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


27 of 27 people found the following review helpful:
5.0 out of 5 stars A comprehensive overview of problem solving techniques, January 25, 2000
By 
David Czarnecki (New York, United States) - See all my reviews
This book provides one of the most comprehensive views of modern techniques in problem solving. The authors use a number of classic problems to illustrate conventional heuristics as well as giving you a solid and working knowledge of more modern evolutionary techniques. The appendicies provide a good introduction to background information on probability theory and statistics used throughout the book, as well as projects for further exploration. Scattered throughout the text are complete and up-to-date references that can be used by the reader to delve deeper into certain topic areas. This book is written to be read and understood by both students and experienced researchers in the field.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No

Share your thoughts with other customers: Create your own review
 
 
 
Most Recent Customer Reviews











Only search this product's reviews



Inside This Book (learn more)
First Sentence:
This is not a book about algorithms. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
quadratic howl, infeasible individuals, adjacency representation, quadratic bowl, total tour length, feasible search space, second cut point, variation operators, legal tour, cooperative coevolution, mutation step size, partial tour, escaping local optima, two cut points, heuristic crossover, warden points, third weighing, repaired version, greedy solution, infeasible solutions, evolutionary algorithms, numerical optimization problems, unsatisfied clauses, fake coin, evaluation function
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Valuated State Space, New York, Los Angeles, United States, Newton Gauss, Swiss Army, Are Some Problems Difficult, Everything Depends, Interest Rate, North Pole, What's the Color of the Bear, Who's Taller
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:




What Other Items Do Customers Buy After Viewing This Item?


Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 
(2)
(1)

Your tags: Add your first tag
 

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums





Look for Similar Items by Category


Look for Similar Items by Subject