Hybrid approach based on ant algorithm for solving traveling salesman problem

Hybrid approach based on ant algorithm for solving traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor20041846
Country: China
Volume: 40
Issue: 4
Start Page Number: 369
End Page Number: 373
Publication Date: Oct 2002
Journal: Journal of Jilin University (Science Edition)
Authors: , , , ,
Keywords: ant system
Abstract:

In the present paper the authors introduce an ant algorithm, a distributed algorithm for the solution of combinatorial optimization problems which has been inspired by the observation of real colonies of ants. Then the authors apply a hybrid approach of ant algorithm with 3-opt and cross-removing to the travelling salesman problem. The results show that it is able to find good solutions quickly.

Reviews

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