A Study of Route Planning Algorithms for Travelling Salesman Problem

by Baidurjya Choudhury

Travelling Salesman Problem (TSP) is a non-trivial, NP-hard routing problem. Given a set of cities and distance between each pair of cities, a salesman must find out the shortest tour that covers all the cities exactly once and returns to the starting city. For a large-scale graph, it is time-consuming to generate all possible edges. Therefore, it is challenging for real-life applications to generate the shortest tour in real-time. Additionally, consider...

• Format: Paperback
• Language: English
• ISBN: 6200439249
• ISBN13: 9786200439246
• Release Date: October 2019
• Publisher: LAP Lambert Academic Publishing
• Length: 72 Pages
• Weight: 0.26 lbs.
• Dimensions: 0.2" x 6.0" x 9.0"