About the book
The Traveling Salesman Problem (TSP) is widely considered as one of the most intensively studied problems in computational mathematics and operations research. Since its inception in the 1800s, it has become the poster child for computational complexity research and Graph Theory. A number of problems have been transformed to a TSP problem and its application base extends into scheduling, manufacturing, routing, and logistics among others. 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 in the development of the next generation of intelligent heuristics. This book is targeted towards both students and researchers and looks to encompass the latest trends in TSP applications, including both theory and practical aspects, with emphasis on cutting edge algorithms, which incorporate unique paradigms such as Graph Theory, Chaos Theory, Quantum Computing, Artificial Swarms, and meta-heuristics.