Solving Traveling Salesmen Problem using Ant Colony OptimizationAlgorithm

Journal of Applied & Computational Mathematics

article

Raghavendra BV¹ 

[1] Mechanical Engineering

关键词: Ant colony optimization;    Travelling salesman problems;    Algorithm models;   

DOI  :  10.4172/2168-9679.1000260

来源: Hilaris Publisher

【 摘 要 】

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.

【 授权许可】

Unknown