Abstrait

A Novel Approach To Solve Tsp Using Ant Colony Optimization

Jyoti Garg, Renu Singla

Travelling salesman problem (TSP) is a routing problem, which is a sub-problem of many application domains such as transportation, network communication. In this paper, we propose a novel methodology which solves the problem ACO algorithm has defined with well distribution strategy in which total search space area is partition into P numbers of hyper-cubic quadrants where P is the dimension of total search space is updating ant colony optimization heuristic parameter that improve the performance When solving TSP. From experimental Results, we can see that proposed algorithm is giving better showing than other standard algorithms.