
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
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.
This book introduces a novel search paradigm for the Traveling Salesman Problem (TSP) by leveraging concepts from dynamical systems theory. The author proposes using the attractor concept to significantly reduce the search space, addressing the combinatorial explosion inherent in TSP solutions. The text provides numerous examples demonstrating the application of this new search algorithm to solve the standard TSP as well as its variants, including multi-objective, dynamic, and probabilistic TSP.
The book presents a specialized approach to a well-known computational problem, suggesting it will appeal to a niche audience within optimization research. The detailed examples and coverage of TSP variants indicate a practical and application-oriented focus. The methodology, drawing from dynamical systems theory, points to a potentially rigorous and mathematically grounded treatment of the subject. This work is likely to be of interest to academics and professionals seeking advanced algorithmic solutions for complex routing and logistics challenges.
Page Count:
141
Publication Date:
2024-07-27
Publisher:
Springer Nature Switzerland
ISBN-10:
3031357213
ISBN-13:
9783031357213
No comments yet. Be the first to share your thoughts!