Revista de Matemática Aplicada e Computacional

Solving Traveling Salesmen Problem using Ant Colony Optimization Algorithm

Abstract

Raghavendra BV

Ant Colony Optimization is a new meta-heuristic technique used for solving different combinatorial optimization problems. ACO is based on the behaviors of ant colony and this method has strong robustness as well as good distributed calculative mechanism. ACO has very good search capability for optimization problems. Travelling salesman problem is one of the most famous combinatorial optimization problems. In this paper we applied the ant colony optimization technique for symmetric travelling salesperson problem. Analysis are shown that the ant select the rich pheromone distribution edge for finding out the best path.