000			a
999			_c34970 _d34970
008			251014b xxu||||| |||| 00| 0 eng d
020			_a9783031357183
082			_a511.5 _bLIW
100			_aLi, Weiqi
245			_aThe traveling salesman problem : optimization with the attractor-based search system
260			_bSpringer, _c2024 _aCham :
300			_axiv, 141 p. ; _bill., (some col.), _c25 cm
365			_b49.99 _c€ _d104.36
490			_aSynthesis lectures on operations research and applications
504			_aIncludes bibliographical references.
520			_aThis 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. In addition, this book: 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.
650			_aTouring problems
942			_2ddc _cBK