UID:
edocfu_9960901001502883
Format:
1 online resource (XV, 287 p. 1 illus.)
Edition:
1st ed. 2023.
ISBN:
3-031-13714-0
Series Statement:
Graduate Texts in Operations Research,
Content:
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.
Note:
Part I: Combinatorial Optimization, Complexity Theory and Problem Modelling -- 1. Elements of Graphs and Complexity Theory -- 2. A Short List of Combinatorial Optimization Problems -- 3. Problem Modelling -- Part II: Basic Heuristic Techniques -- 4. Constructive Methods -- 5. Local Search -- 6. Decomposition Methods -- Part III: Popular Metaheuristics -- 7. Randomized Methods -- 8. Construction Learning -- 9. Local Search Learning -- 10. Population Management -- 11. Heuristics Design -- 12. Codes.
,
English
Additional Edition:
ISBN 3-031-13713-2
Language:
English
DOI:
10.1007/978-3-031-13714-3
