摘要: 介绍了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
吕志民;杨 娟;徐金梧. 基于蚁群算法的m–团队定向问题求解[J]. 计算机工程, 2006, 32(24): 164-166.
LV Zhimin; YANG Juan; XU Jinwu. Solution of m–team Orienteering Problem
Based on Ant Colony Algorithm
[J]. Computer Engineering, 2006, 32(24): 164-166.