High performance ant colony optimizer (HPACO) for travelling salesman problem (TSP)

Abstract

Travelling Salesman Problem (TSP) is a classical combinatorial optimization problem. This problem is NP-hard in nature and is well suited for evaluation of unconventional algorithmic approaches based on natural computation. Ant Colony Optimization (ACO) technique is one of the popular unconventional optimization technique to solve this problem. In this paper, we propose High Performance Ant Colony Optimizer (HPACO) which modifies conventional ACO. The result of implementation shows that our proposed technique has a better performance than the conventional ACO.