首页 | 本学科首页   官方微博 | 高级检索  
     

用改进的人工鱼群算法求解TSP问题
引用本文:李跃松,樊金生,张巧迪. 用改进的人工鱼群算法求解TSP问题[J]. 石家庄铁道学院学报(社会科学版), 2011, 0(2): 103
作者姓名:李跃松  樊金生  张巧迪
作者单位:石家庄铁道大学 信息科学与技术学院;石家庄铁道大学 信息科学与技术学院;石家庄铁道大学 信息科学与技术学院
摘    要:针对人工鱼群算法在寻优过程中存在的不足,结合嗅觉在自然界鱼类捕食过程中的重要作用,在基本人工鱼群算法的基础上,提出了具有嗅觉特征的人工鱼群算法。最后,利用改进的人工鱼群算法成功解决了旅行商问题,并且通过比较基本人工鱼群算法与改进人工鱼群算法的实验结果,得出结论,改进后的人工鱼群算法在算法搜索时间、全局最优值精确度方面都有了显著的提高。

关 键 词:组合优化问题;人工鱼群算法;嗅觉;旅行商问题
收稿时间:2010-12-25

Solving TSP with Improved Artificial Fish Swarm Algorithm
Li Yuesong,Fan Jinsheng and Zhang Qiaodi. Solving TSP with Improved Artificial Fish Swarm Algorithm[J]. , 2011, 0(2): 103
Authors:Li Yuesong  Fan Jinsheng  Zhang Qiaodi
Affiliation:Dept.of Information Science and Technology, Shijiazhuang Tiedao University;Dept.of Information Science and Technology, Shijiazhuang Tiedao University;Dept.of Information Science and Technology, Shijiazhuang Tiedao University
Abstract:]In view of the weakness of artificial fish swarm algorithm in the process of optimization, an improved artificial swarm algorithm with the characteristics of smell based on artificial fish swarm algorithm is proposed in the dissertation, which integrates the important role of the fish smell in the predatory process. Finally, Traveling Salesman Problem is solved with the improved artificial fish swarm algorithm. Comparing the experiment results of two algorithms, the improved artificial fish swarm algorithm is better in search time and the precision of optimal value than the original artificial fish swarm algorithm.
Keywords:combinatorial optimization problem   artificial fish swarm algorithm   smell   traveling salesman problem
点击此处可从《石家庄铁道学院学报(社会科学版)》浏览原始摘要信息
点击此处可从《石家庄铁道学院学报(社会科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号