|International Journal of Computer Applications
|Foundation of Computer Science (FCS), NY, USA
|Volume 152 - Number 8
|Year of Publication: 2016
|Authors: Evans Baidoo, Stephen O. Oppong
Evans Baidoo, Stephen O. Oppong . Solving the TSP using Traditional Computing Approach. International Journal of Computer Applications. 152, 8 ( Oct 2016), 13-19. DOI=10.5120/ijca2016911906
From the last decade, even though there have been sudden advances in present technology in all areas, there exist some real-world NP composite problems that still escape scientists. The Travel salesman Problem is no exception. As it is an NP-Hard problem, lots of divergent solutions have been created to determine in shortest possible time, the optimal solution. Traditional algorithms are one of the oldest suggested solutions which present successful solutions that are to a larger extent optimal except in few occasions which may be close to the optimal. In this paper, a variant of the classical TSP, Random TSP (RTSP) is computed using various traditional algorithms. Their performances are evaluated with emphasis on length of tour and the algorithm effectiveness. Also, this paper presents the comparison among the algorithms based on a variety of parameters that facilitated to decide the superior algorithm with regards to their needs.