Skip to Main Content
ASME Press Select Proceedings

International Conference on Computer and Computer Intelligence (ICCCI 2011)

Yi Xie
Yi Xie
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

The Ant Colony method is one of the most used metaheuristics in the analysis of Traveling Salesman Problem (TSP). Our objective in this research is to take one of the instances proposed by the research group of University of Heidelberg in Germany and apply this method to obtain the optimal solution that has been found so far. First of all, it is important to define aspects such as the TSP, metaheuristics, and then analyze how works the Ant Colony method, the characteristics that has the instance that we chose and finally the pseudocode. All this was done by consulting, and investigating, papers, articles and research done earlier by other scientists, mathematicians, and even students like us.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal