Engineering & Transportation
Qty:1
  • List Price: $139.00
  • Save: $25.72 (19%)
Only 8 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Metaheuristics: From Desi... has been added to your Cart
Used: Good | Details
Sold by apex_media
Condition: Used: Good
Comment: Ships direct from Amazon! Qualifies for Prime Shipping and FREE standard shipping for orders over $25. Overnight and 2 day shipping available!
Access codes and supplements are not guaranteed with used items.
Trade in your item
Get a $3.79
Gift Card.
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Metaheuristics: From Design to Implementation Hardcover – June 22, 2009

ISBN-13: 978-0470278581 ISBN-10: 0470278587

Buy New
Price: $113.28
24 New from $88.14 13 Used from $80.00
Amazon Price New from Used from
Hardcover
"Please retry"
$113.28
$88.14 $80.00
Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Frequently Bought Together

Metaheuristics: From Design to Implementation + The Design of Approximation Algorithms
Price for both: $157.91

Buy the selected items together

NO_CONTENT_IN_FEATURE

Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Product Details

  • Hardcover: 624 pages
  • Publisher: Wiley (June 22, 2009)
  • Language: English
  • ISBN-10: 0470278587
  • ISBN-13: 978-0470278581
  • Product Dimensions: 9.4 x 6.3 x 1.2 inches
  • Shipping Weight: 2.2 pounds (View shipping rates and policies)
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Best Sellers Rank: #858,382 in Books (See Top 100 in Books)

Editorial Reviews

Review

“In conclusion, I found reading Metaheuristics: From Design to Implementation to be pleasant and enjoyable. I particularly recommend it as a reference for researchers and students of computer science or operations research who want a global outlook of metaheuristics methods. It would also be extremely useful for introducing graduate and PhD students who are new to the field of heuristics and metaheuristics to the amazing world of the designing of these procedures.”  (Informs, 1 July 2012)

"It will be an indispensable text for advanced undergraduate and graduate students in computer science, operations research, applied mathematics, control, business and management and engineering." (Zentralblatt MATH, 2010)

 

From the Back Cover

A UNIFIED VIEW OF METAHEURISTICS

This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling. It presents the main design questions for all families of metaheuristics and clearly illustrates how to implement the algorithms under a software framework to reuse both the design and code.

Throughout the book, the key search components of metaheuristics are considered as a toolbox for:

  • Designing efficient metaheuristics (e.g. local search, tabu search, simulated annealing, evolutionary algorithms, particle swarm optimization, scatter search, ant colonies, bee colonies, artificial immune systems) for optimization problems
  • Designing efficient metaheuristics for multi-objective optimization problems
  • Designing hybrid, parallel, and distributed metaheuristics
  • Implementing metaheuristics on sequential and parallel machines

Using many case studies and treating design and implementation independently, this book gives readers the skills necessary to solve large-scale optimization problems quickly and efficiently. It is a valuable reference for practicing engineers and researchers from diverse areas dealing with optimization or machine learning; and graduate students in computer science, operations research, control, engineering, business and management, and applied mathematics.


More About the Author

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

Customer Reviews

4.0 out of 5 stars
5 star
0
4 star
2
3 star
0
2 star
0
1 star
0
See both customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

3 of 3 people found the following review helpful By Chris Jones on May 4, 2010
Format: Hardcover Verified Purchase
This book provides an amazingly thorough overview of its subject. It describes most algorithms in detail. If you are trying to solve a specific optimization problem, this book is a great place to start before diving into research papers that might be more specific to your domain. Overall, I highly recommend the book.

As someone who was reading it with a specific purpose in mind, I think the book has two minor issues. First, it is sometimes needlessly academic. It occasionally expresses concepts which are quite simple in unnecessarily mathematical and confusing terms.

Second, it doesn't always do a good job of explaining why you would choose a particular class of algorithms for a particular problem domain. For many algorithms in the book, it contains a one sentence list of the kinds of problems the algorithm is used for, but it often doesn't discuss why the algorithm fits a particular problem domain well, or how you would decide exactly which algorithm to use. To some extent, I think this is a problem with metaheuristics in general (they are kind of like "if you knew a clever way to guess better and better solutions, you'll do well, but its really hard to guess better and better solutions consistently, so here are lots of different ways to do it, but who knows which way will work." In fact, the book often suggests 'self-tuning' algorithms, which are basically algorithms that 'guess how to guess.' Its all very meta. Or maybe meta-meta.)

Those minor criticisms aside, I doubt you will find a more thorough overview of the topic. The book is readable, and if this is an area you need to learn about in detail, I highly recommend it.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
3 of 3 people found the following review helpful By W Boudville HALL OF FAMETOP 1000 REVIEWERVINE VOICE on September 19, 2009
Format: Hardcover
The book is a good and detailed description of what metaheuristics involves. This is applied to solving hard computational problems. There are summaries of many methods developed over the last 50 years. The simplex method. Metropolis Monte Carlo. Simulated annealing. Genetic algorithms. And others. There is deliberately not enough information about most of these for you to use them given only the book as a starting point. Space considerations.

But mostly the book explains at a higher level, how methods can be understood. Some are for exploiting; ie. intensively looking in a given region of the objective space around a starting point. Simulated annealing is a good example of such a method.

Other methods are for exploring. A broader search in the objective or solution space. Genetic algorithms, with their mutations and crossover recombinations are very strong here, using ideas borrowed from biological evolution.

More importantly, the book shows how many hard problems have to be tackled by a combination of exploring and exploiting. The combining of algorithms is what gives metaheuristics its name.

One caveat is that even at a summary level, the description of tabu search was a bit unclear, compared to the excellent synopses of simulated annealing and genetic algorithms.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

What Other Items Do Customers Buy After Viewing This Item?