文档介绍：第 28 卷第 5 .5
2011 年 5 月 Vol No2011
Application Research puters May
一种改进蚁群算法研究和旅游
景区路径规划问题求解倡
胡军国, 祁亨年, 董峰, 汪杭军
(浙江农林大学信息工程学院, 浙江临安 311300)
摘要: 针对旅游景区路径规划问题的复杂性,将景区路径分为全景区图和子景区图,并归为同一问题解决。
提出一种改进蚁群算法,设计繁殖蚂蚁、视觉蚂蚁和普通蚂蚁,各类蚂蚁按各自规则遍历;蚂蚁遍历完所有景点,
求出最佳行程,并根据约束条件对符合要求的路径上的信息素进行更新;再结合模拟退火算法,在每个状态
MIN
对蚁群行程进行舍取,重复迭代,最终获得全局最优解。仿真实验结果表明,该方法在景区路径规划中表现出良
好的稳定性和高效性。
关键词: 路径规划; 蚁群算法; 模拟退火算法; 繁殖蚂蚁; 视觉蚂蚁
中图分类号: 181 文献标志码: 文章编号: 1001唱3695(2011)05唱1647唱04
TP A
: /. .
doi j issn
Improved ant colony algorithm for path planning of tourist scenic area
唱, 唱, , 唱
HU Jun guo QI Heng nian DONG Feng WANG Hang jun
( College of Information Engineering, Zhejiang Agriculture Forestry University, Lin’ an Zhejiang 311300, China)
&
Abstract: ,
Due to plexity of唱 the path planning, for tourist scenic area this paper divided the path of. tourist scenic area唱
into panoramic scenic graph and sub scenic, graph and regarded these, graph as the same problem to, solve The paper put for
ward the improved. ant colony algorithm and designed, breeding ants visual ants mon, ants which travelled by their唱
own, rules When the ants travelled all the scenic spots. it could find the best path MIN and according, to restriction condi
tion updated the’ pheromone of the appropriate, bined with simulated. annealing algorithm repeatedly receivi