蚁群算法在定向问题中的应用
首发时间:2009-01-04
摘要:在极大极小蚁群系统的基础上,提出了一个求解定向问题的蚁群算法.给出了一种刻画两个解之间差异的距离.利用这种距离,提出了自适应更新信息素下界和自适应重新初试化信息素两种方法来避免停滞,其基本思想是使得构造的解与优解的距离足够大。实验结果表明:与Chao等人提出的算法相比较,蚁群算法能快速地求得高质量的解;并且所提出的方法能有效避免停滞,从而改进蚁群搜索能力。
For information in English, please click here
Solving the orienteering problem by ant colony optimization
Abstract:Inspired by max-min ant system, an ant colony optimization algorithm is proposed for the orienteering problem. A distance is proposed to characterize the difference between two solutions. Based on this distance, two methods, that is, adaptively choosing the lower trail limit and reinitializing pheromone trails, are proposed to avoid stagnation. The basic idea is to make the distance between the solutions constructed and the best solution large enough. The experimental results show that: compared with the promising algorithm of Chao et al., the proposed algorithm can quickly obtain high-quality solutions; moreover, the proposed methods can effectively avoid stagnation and improve the search ability of ants.
Keywords: Ant Colony Optimization Orienteering Problem Distance
论文图表:
引用
No.2723338449712310****
同行评议
共计0人参与
勘误表
蚁群算法在定向问题中的应用
评论
全部评论0/1000