Design of Heuristic Algorithms for Hard Optimization : : With Python Codes for the Travelling Salesman Problem / / by Éric D. Taillard.
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 beca...
Saved in:
| Superior document: | Graduate Texts in Operations Research, |
|---|---|
| VerfasserIn: | |
| Place / Publishing House: | Cham : : Springer International Publishing :, Imprint: Springer,, 2023. |
| Year of Publication: | 2023 |
| Edition: | 1st ed. 2023. |
| Language: | English |
| Series: | Graduate Texts in Operations Research,
|
| Physical Description: | 1 online resource (XV, 287 p. 1 illus.) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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.