The Traveling Salesman Problem
Optimization with the Attractor-Based Search System
Springer International Publishing
ISBN 978-3-031-35719-0
Standardpreis
Bibliografische Daten
eBook. PDF
2023
XIV, 141 p. 66 illus., 8 illus. in color..
In englischer Sprache
Umfang: 141 S.
Verlag: Springer International Publishing
ISBN: 978-3-031-35719-0
Weiterführende bibliografische Daten
Das Werk ist Teil der Reihe: Synthesis Lectures on Operations Research and Applications Synthesis Collection of Technology (R0)
Produktbeschreibung
This book presents a new search paradigm for solving the Traveling Salesman Problem (TSP). The intrinsic difficulty of the TSP is associated with the combinatorial explosion of potential solutions in the solution space. The author introduces the idea of using the attractor concept in dynamical systems theory to reduce the search space for exhaustive search for the TSP. Numerous examples are used to describe how to use this new search algorithm to solve the TSP and its variants including: multi-objective TSP, dynamic TSP, and probabilistic TSP. This book is intended for readers in the field of optimization research and application.
- Provides a complete understanding of the attractor concept in heuristic local searches
- Presents a new search paradigm for solving a NP-complete combinatorial problem
- Introduces the use of the attractor concept in dynamical systems theory to reduce the search space for TSP
Autorinnen und Autoren
Produktsicherheit
Hersteller
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com