Determining the shortest path for Travelling Salesman Problem using Nearest Neighbor Algorithm

The Travelling Salesman Problem is a traditional algorithm used to find the shortest or least path.This problem is mostly utilized in computer science to deliver packets from source to destination as there are lots of routes present in a network. This number of routes can cause congestion, delay or data loss, so utilizing Travelling Salesman Problem to find the shortest path from sender to receiver is an efficient way to transmit data with less congestion and also in less time. It is generally used to find the optimum solution for a complex network. The Travelling Salesman Problem can be solved using meta-heuristic approaches such as Ant colony optimization or genetic algorithm, however the easiest approach to solve the Travelling Salesman Problem is Nearest Neighbor Algorithm. The optimum solution of Travelling Salesman will save time and travelling expenses of a salesman. In Travelling Salesman problem, the main aim is to visit each city in a network once following the shortest path and return to the starting position.