Traveling Salesman Problem (TSP): A Comparative Analysis

In the traveling salesman problem (TSP), we have a network of cities connected by roads. We need to find a tour that visits each of the cities exactly once, minimizing the total distaThe TSP has several applications even in its purest formulation, such as planning, logistics, and the manufacture of microchips. Slightly modified, it appears as a sub-problem in many areas, such as genome sequencing. nce traveled. The work in this book has been focused on to solve the TSP of large size heuristically for optimization by thorough study of the various solution finding approaches (Genetic Algorithm, Tabu Search and Nearest Neighbor Approach) and to apply these approaches on selected TSP to find the optimal solution. Then analyze (compare) the obtained solutions and find the most efficient approach depending on the problem size.

Autorentext

Author is presently working as Assistant Professor in Department of Mechanical Engg. in Shoolini University of Bio-Technology and Management Sciences, Solan (H.P.). His qualification is B-Tech (Mechanical Engg.), M-Tech (Mechanical Engg.) from PTU Jalandhar and Pursuing Ph.D. (Mechanical Engg.) from PEC University of Technology Chandigarh