000 03423nam a22006015i 4500
001 978-3-031-35719-0
003 DE-He213
005 20251030110810.0
007 cr nn 008mamaa
008 230708s2024 sz | s |||| 0|eng d
020 _a9783031357190
_9978-3-031-35719-0
024 7 _a10.1007/978-3-031-35719-0
_2doi
050 4 _aT57.6-57.97
050 4 _aT55.4-60.8
072 7 _aKJT
_2bicssc
072 7 _aBUS049000
_2bisacsh
072 7 _aKJT
_2thema
100 1 _aLi, Weiqi.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_965521
245 1 4 _aThe Traveling Salesman Problem
_h[electronic resource] :
_bOptimization with the Attractor-Based Search System /
_cby Weiqi Li.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXIV, 141 p. 66 illus., 8 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Operations Research and Applications,
_x2770-6311
505 0 _aIntroduction -- The Traveling Salesman Problem (TSP) -- The Nature of Heuristic Local Search -- he Attractor-Based Search System -- Solving Multi-objective TSP -- Solving Dynamic TSP -- Solving Probabilistic TSP -- Conclusion.
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 0 _aOperations research.
_957943
650 0 _aManagement science.
_957941
650 0 _aMathematical optimization.
_965522
650 0 _aMathematics.
_965523
650 0 _aDynamics.
_965524
650 0 _aNonlinear theories.
_965525
650 0 _aDynamical systems.
_965526
650 1 4 _aOperations Research, Management Science.
_965527
650 2 4 _aOptimization.
_965528
650 2 4 _aApplications of Mathematics.
_965529
650 2 4 _aApplied Dynamical Systems.
_965530
650 2 4 _aDynamical Systems.
_965531
710 2 _aSpringerLink (Online service)
_965532
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031357183
776 0 8 _iPrinted edition:
_z9783031357206
776 0 8 _iPrinted edition:
_z9783031357213
830 0 _aSynthesis Lectures on Operations Research and Applications,
_x2770-6311
_965533
856 4 0 _uhttps://doi.org/10.1007/978-3-031-35719-0
912 _aZDB-2-SXSC
999 _c56223
_d56223