Abstract

• The travelling salesman problem (TSP) is a combinational optimization problem in which the goal is to find the shortest path between different cities that the salesman takes. The travelling salesman problem involves finding the trip of minimum cost and the processing time that a salesman can make to visit the cities in a sales territory once and only once (represented by a complete graph with weights on the edges), starting and ending the trip in the same city. This paper adopts the nearest neighbour and two sided nearest neighbour algorithm to solve the well-known travelling salesman problem. The algorithms were implemented using (C++) and MS VC++programming language. The approach can be tested on two graphs that making a TSP tour instance of 5-city, 14-city and more. The computation results validate the performance of the proposed algorithm.