作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2006, Vol. 32 ›› Issue (24): 164-166. doi: 10.3969/j.issn.1000-3428.2006.24.059

• 人工智能及识别技术 • 上一篇    下一篇

基于蚁群算法的m–团队定向问题求解

吕志民1,杨 娟2,徐金梧1   

  1. (1. 北京科技大学高效轧制国家工程研究中心,北京 100083;2. 北京邮电大学计算机科学与技术学院,北京 100876)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-12-20 发布日期:2006-12-20

Solution of m–team Orienteering Problem
Based on Ant Colony Algorithm

LV Zhimin1, YANG Juan2, XU Jinwu1   

  1. (1. National Engineering Research Center for Advanced Rolling, University of Sci. & Tech., Beijing 100083;
    2. School of Computer Science and Technology, Beijing University of Posts and Telecommunications, Beijing 100876)
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-12-20 Published:2006-12-20

摘要: 介绍了m–团队定向问题的特性及目标,提出了基于蚁群算法的问题求解算法。在该算法中同种群不同个体之间采用访问禁忌表方式交换信息、相互协作共同完成路径优化,不同种群间通过“信息素”控制每个种群中个体的行为。计算结果表明了算法和模型的有
效性。

关键词: 蚁群算法, 定向运动, 团队定向问题, 车辆路径问题

Abstract: The object and characteristic of m-team orienteering problem (m–TOP), and a new solution framework based on ant colony algorithm for m–TOP are introduced. In the solution framework, different ants in one sub-colony exchange the information of visited control points by tabu table, and cooperate with in optimizing visit route; the visited route of ant in different sub-ant colony is controlled by pheromone. The simulation results proved the model and solution framework are effective.

Key words: Ant colony algorithm, Orienteering sport, Team orienteering problem, VRP