Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem Hardback -
by Éric D. Taillard
- New
- Hardback
A$104.66
A$15.50
Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Standard delivery: 7 to 12 days
Ships from Ria Christie Collections (Greater London, United Kingdom)
Details
- Title Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem
- Author Éric D. Taillard
- Binding Hardback
- Condition New
- Features Illustrated
- Bookseller's Inventory # ria9783031137136_inp
- ISBN 9783031137136
- Quantity available 185
About Ria Christie Collections Greater London, United Kingdom
Biblio member since 2014
Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections
30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.
Reader reviews for Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the subject because it is very intuitive and its solutions can be graphically represented. The book features a wealth of illustrations that allow the concepts to be understood at a glance.
The book approaches the main metaheuristics from a new angle, deconstructing them into a few key concepts presented in separate chapters: construction, improvement, decomposition, randomization and learning methods. Each metaheuristic can then be presented in simplified form as a combination of these concepts. This approach avoids giving the impression that metaheuristics is a non-formal discipline, a kind of cloud sculpture. Moreover, it provides concrete applications of the travelling salesman problem, which illustrate in just a few lines of code how to design a new heuristic and remove all ambiguities left by a general framework. Two chapters reviewing the basics of combinatorial optimization and complexity theory make the book self-contained. As such, even readers with a very limited background in the field will be able to follow all the content.
