03268nam a22005655i 4500001001800000003000900018005001700027007001500044008004100059020003700100024003500137050001600172050001500188072001600203072002300219072001500242100007900257245012900336250001800465264006900483300006400552336002600616337002600642338003600668347002400704490007500728505023100803520094101034650003201975650003102007650003802038650002402076650002102100650003102121650003002152650005202182650002502234650004002259650003802299650003002337710004102367773002602408776003602434776003602470776003602506830008202542856004602624912001502670999001702685978-3-031-35719-0DE-He21320251030110810.0cr nn 008mamaa230708s2024    sz |    s    |||| 0|eng d  a97830313571909978-3-031-35719-07 a10.1007/978-3-031-35719-02doi 4aT57.6-57.97 4aT55.4-60.8 7aKJT2bicssc 7aBUS0490002bisacsh 7aKJT2thema1 aLi, Weiqi.eauthor.4aut4http://id.loc.gov/vocabulary/relators/aut96552114aThe Traveling Salesman Problemh[electronic resource] :bOptimization with the Attractor-Based Search System /cby Weiqi Li.  a1st ed. 2024. 1aCham :bSpringer Nature Switzerland :bImprint: Springer,c2024.  aXIV, 141 p. 66 illus., 8 illus. in color.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda1 aSynthesis Lectures on Operations Research and Applications,x2770-63110 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.  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. 0aOperations research.957943 0aManagement science.957941 0aMathematical optimization.965522 0aMathematics.965523 0aDynamics.965524 0aNonlinear theories.965525 0aDynamical systems.96552614aOperations Research, Management Science.96552724aOptimization.96552824aApplications of Mathematics.96552924aApplied Dynamical Systems.96553024aDynamical Systems.9655312 aSpringerLink (Online service)9655320 tSpringer Nature eBook08iPrinted edition:z978303135718308iPrinted edition:z978303135720608iPrinted edition:z9783031357213 0aSynthesis Lectures on Operations Research and Applications,x2770-631196553340uhttps://doi.org/10.1007/978-3-031-35719-0  aZDB-2-SXSC  c56223d56223