Advanced ACO Metaheuristic for Travelling Salesman Problem: A Proposed Technique
Awadhesh Kumar Jha · International Journal for Research in Applied Science and Engineering Technology · 2017
ACO meta-heuristic is an advanced approach of solving the various combinatorial optimization problems with positive feedback. ACO algorithms has some limitations such as pheromone stagnation due to which the optimal result get stuck in local search and give the partial optimised results. To overcome the problem of pheromone stagnation we make two advancements in the ACO algorithm first to use the 2 opt local search method to search local optimal result in less time and second use the new heuristic function which timely update the amount of pheromone with time. The advancements of the ACO algorithm will be implemented on the Travelling salesman problem which is the most famous problem in the operation research and logistics.