| 書目名稱 | The Traveling Salesman Problem |
| 副標題 | Optimization with th |
| 編輯 | Weiqi Li |
| 視頻video | http://file.papertrans.cn/922/921434/921434.mp4 |
| 概述 | 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 attracto |
| 叢書名稱 | Synthesis Lectures on Operations Research and Applications |
| 圖書封面 |  |
| 描述 | .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.. |
| 出版日期 | Book 2024 |
| 關(guān)鍵詞 | Combinatorial Optimization; Heuristic Local Search; Computing Theory and Algorithms; Operations Researc |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-031-35719-0 |
| isbn_softcover | 978-3-031-35721-3 |
| isbn_ebook | 978-3-031-35719-0Series ISSN 2770-6303 Series E-ISSN 2770-6311 |
| issn_series | 2770-6303 |
| copyright | The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 23:39
發(fā)表于 2025-3-21 17:39:02
