Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem

Éric D. Taillard

ISBN 10: 3031137167 / ISBN 13: 9783031137167

Edité par Springer International Publishing, Springer International Publishing, 2023

A propos de cet article

Druck auf Anfrage Neuware - Printed after ordering - 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.

N° de réf. du vendeur 9783031137167

Détails bibliographiques

• Titre: Design of Heuristic Algorithms for Hard Optimization : With Python Codes for the Travelling Salesman Problem
• Éditeur: Springer International Publishing, Springer International Publishing
• Date de parution: 2023
• Langue: anglais
• ISBN à 10 chiffres: 3031137167
• ISBN à 13 chiffres: 9783031137167
• Reliure: Taschenbuch
• État de l'article: Neu
• Dimensions: 235 L x 155 H x 17 P (en millimètres) 235 millimètres de largeur par 155 millimètres de hauteur par 17 millimètres de profondeur
• Poids: 464 grammes

A propos de ce titre

Synopsis

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.

À propos de l?auteur

Éric D. Taillard is a professor at the University of Applied Sciences and Arts of Western Switzerland, HEIG-VD campus in Yverdon-les-Bains. After completing his studies and obtaining a PhD at the Swiss Federal Institute of Technology in Lausanne, he worked as a researcher at the Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation in Montreal, Canada, and then at the Dalle Molle Institute for Artificial Intelligence in Lugano, Switzerland.
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.