| 书目名称 | Design of Heuristic Algorithms for Hard Optimization |
| 副标题 | With Python Codes fo |
| 编辑 | Éric D. Taillard |
| 视频video | |
| 概述 | 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 t |
| 丛书名称 | Graduate Texts in Operations Research |
| 图书封面 |  |
| 描述 | .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 theo |
| 出版日期 | Textbook‘‘‘‘‘‘‘‘ 2023 |
| 关键词 | Algorithms; Heuristics; Travelling Salesman; Local Search; Metaheuristics; Combinatorial Optimization; Art |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-031-13714-3 |
| isbn_softcover | 978-3-031-13716-7 |
| isbn_ebook | 978-3-031-13714-3Series ISSN 2662-6012 Series E-ISSN 2662-6020 |
| issn_series | 2662-6012 |
| copyright | The Editor(s) (if applicable) and The Author(s) 2023 |
发表于 2025-3-21 16:53:33
