TY - CHAP A1 - Weiqi Li ED1 - Donald Davendra ED2 - Magdalena Bialic-Davendra Y1 - 2020-12-09 PY - 2020 T1 - Solution Attractor of Local Search System: A Method to Reduce Computational Complexity of the Traveling Salesman Problem N2 - The Traveling Salesman Problem (TSP) is widely considered one of the most intensively studied problems in computational mathematics and operations research. Since its inception, it has become the poster child for computational complexity research. A number of problems have been transformed to a TSP problem and its application base now extends into scheduling, manufacturing, routing, and logistics. With the advent of high-performance computing and advanced meta-heuristics such as GPU programming and swarm-based algorithms, the TSP problem is positioned firmly as the go-to problem for the development of the next generation of high-performance intelligent heuristics. This book looks to leverage some of these new paradigms for both students and researchers in this field. BT - Novel Trends in the Traveling Salesman Problem SP - Ch. 3 UR - https://doi.org/10.5772/intechopen.90521 DO - 10.5772/intechopen.90521 SN - 978-1-83962-454-4 PB - IntechOpen CY - Rijeka Y2 - 2021-02-26 ER -