The Solutions Of Travelling Salesman Problem using Ant Colony and Improved Particle Swarm Optimization Techniques

In this paper we consider two widely used Swarm Intelligence (SI) inspired heuristic approaches Ant Colony Optimization and Improved Particle Swarm Optimization to solve classical optimization problem called Travelling Salesman Problem (TSP) that cannot be solved conventionally because it is NP hard problem. If one tries to solve TSP using conventional approach it will take years to find optimal solution. Therefore, Heuristic algorithm is the feasible solution to such problem. Interest of researchers has been attracted by Ant Colony Optimization (ACO) and Improved Particle Swarm Optimization (PSO) algorithms because of their simple, effective and efficient nature in solving real world optimization problems. The comparative analyses based on Performance have been done by using ACO and Improved PSO respectively in solving TSP in this paper. The comparative results are shown and it is devised that Improved PSO is better approach to solve the traveling salesman problem.