A hybrid ant colony algorithm for solving a traveling salesman problem

A hybrid ant colony algorithm for solving a traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor20051161
Country: China
Volume: 39
Issue: 4
Start Page Number: 31
End Page Number: 34
Publication Date: Oct 2003
Journal: Journal of Northwest Normal University
Authors:
Keywords: ant system
Abstract:

A hybrid ant algorithm is presented to prevent premature termination in the canonical ant colony algorithm. The main idea of the algorithm is that a hybrid pheromone update strategy is used based on the solution that the artificial ants have found. Computer simulation shows that the proposed algorithm can efficiently find better minima by avoiding premature convergence for hard TSP problems.

Reviews

Required fields are marked *. Your email address will not be published.