Overview
- This book is open access, which means that you have free and unlimited access
- Offers step-by-step procedures for the design of heuristic algorithms
- Contains numerous short illustrative codes for the travelling salesman problem
- Covers the main metaheuristics in a simple but rigorous way
Part of the book series: Graduate Texts in Operations Research (GRTOPR)
Buy print copy
Tax calculation will be finalised at checkout
Table of contents (12 chapters)
-
Front Matter
-
Combinatorial Optimization, Complexity Theory, and Problem Modelling
-
Front Matter
-
-
Basic Heuristic Techniques
-
Front Matter
-
-
Popular Metaheuristics
-
Front Matter
-
-
Back Matter
Keywords
About this book
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, whichillustrate 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.
Authors and Affiliations
About the author
He has over 30 years of research experience in the field of metaheuristics. Outside of Switzerland, he has been invited to teach this subject at various universities: Vienna and Graz in Austria, Nantes in France and Hamburg in Germany.
Bibliographic Information
Book Title: Design of Heuristic Algorithms for Hard Optimization
Book Subtitle: With Python Codes for the Travelling Salesman Problem
Authors: Éric D. Taillard
Series Title: Graduate Texts in Operations Research
DOI: https://doi.org/10.1007/978-3-031-13714-3
Publisher: Springer Cham
eBook Packages: Business and Management, Business and Management (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s) 2023
Hardcover ISBN: 978-3-031-13713-6Published: 30 October 2022
Softcover ISBN: 978-3-031-13716-7Published: 31 October 2023
eBook ISBN: 978-3-031-13714-3Published: 29 October 2022
Series ISSN: 2662-6012
Series E-ISSN: 2662-6020
Edition Number: 1
Number of Pages: XV, 287
Number of Illustrations: 1 b/w illustrations
Topics: Operations Research/Decision Theory, Optimization, Computational Mathematics and Numerical Analysis, Algorithms, Computational Science and Engineering, Artificial Intelligence