In this paper, Traveling Salesman Problem was implemented using Clonal Selection Algorithm and the modified version of Clonal Selection Algorithm. The performance of both the algorithm was compared with preexisting approaches GA (Genetic Algorithm) and BB (Branch and Bound) for the same problem. The distance covered in the tour was measured for each algorithm by varying the number of cities. The run time for the algorithm was measured to evaluate the performance of TSP. The two proposed approaches - CSA and its modified version were compared against - GA and BB methods and the results indicate that the proposed methods provide better solution to TSP with respect to the shorter tour distance and shorter time of convergence as compared to the conventional approaches.
展开▼
