Artificial Fish Algorithm to solve Traveling Salesman Problem

摘要：

　　TSP has been studied in many methods by various algorithms.with the increase of the TSP scale,there are some problems appear in the related solution,such as solving the optimal solution and so on.With the increasing calculation nodes,the convergence degree and computing difficulty of TSP will increase enormously.Artificial fish is an optimize algorithm based on biology model putting forward at present.Proposed a solution for TSP based on the Artificial fish algorithm,describes the mathematic model of TSP,and Expounds the steps of the algorithm in details.by testing the algorithm,we know that,the algorithm can obtain the best solution,in global search,convergence rate,,but the robustness has to be improved in the future.

关键词： Artificial Fish Algorithm Tsp Genetic Algorithm Ant Colony Algorithm

作者: Jian-Ping WANG Yan-Pei LIU Yong HUANG

作者单位: School of Information Engineer, Henan Institute of Science and Technology, 453003, China

会议类型: 国际会议

会议名称: the Second International Conference on Frontiers of Manufacturing and Design Science(第二届制造与设计科学国际会议(ICFMD 2011))

会议地点: 台湾

会议语种:英文

页码: 4410-4414

在线出版日期: 2011-12-11（万方平台首次上网日期，不代表论文的发表时间）