Description
| Product ID: | 9783031137136 |
| Product Form: | Hardback |
| Country of Manufacture: | GB |
| Series: | Graduate Texts in Operations Research |
| Title: | Design of Heuristic Algorithms for Hard Optimization |
| Subtitle: | With Python Codes for the Travelling Salesman Problem |
| Authors: | Author: Eric D. Taillard |
| Page Count: | 287 |
| Subjects: | Operational research, Operational research, Numerical analysis, Optimization, Maths for scientists, Artificial intelligence, Numerical analysis, Optimization, Maths for scientists, Artificial intelligence |
| Description: | Select Guide Rating 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. 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. |
| Imprint Name: | Springer International Publishing AG |
| Publisher Name: | Springer International Publishing AG |
| Country of Publication: | GB |
| Publishing Date: | 2022-10-30 |
