摘要
介绍了m–团队定向问题的特性及目标,提出了基于蚁群算法的问题求解算法。在该算法中同种群不同个体之间采用访问禁忌表方式交换信息、相互协作共同完成路径优化,不同种群间通过“信息素”控制每个种群中个体的行为。计算结果表明了算法和模型的有效性。
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.
出处
《计算机工程》
EI
CAS
CSCD
北大核心
2006年第24期164-166,共3页
Computer Engineering
基金
国家自然科学基金资助项目(70371057)
