一种改进蚁群算法研究和旅游景区路径规划问题求解  

Improved ant colony algorithm for path planning of tourist scenic area

作　　者：胡军国[1] 祁亨年[1] 董峰[1] 汪杭军[1] 

机构地区：[1]浙江农林大学信息工程学院,浙江临安311300

出　　处：《计算机应用研究》2011年第5期1647-1650,共4页Application Research of Computers

基　　金：浙江省公益性资助项目(2011C31G2100015);浙江省自然科学基金资助项目(Y1080777);国家自然科学基金资助项目(60970082)

摘　　要：针对旅游景区路径规划问题的复杂性,将景区路径分为全景区图和子景区图,并归为同一问题解决。提出一种改进蚁群算法,设计繁殖蚂蚁、视觉蚂蚁和普通蚂蚁,各类蚂蚁按各自规则遍历;蚂蚁遍历完所有景点,求出最佳行程MIN,并根据约束条件对符合要求的路径上的信息素进行更新;再结合模拟退火算法,在每个状态对蚁群行程进行舍取,重复迭代,最终获得全局最优解。仿真实验结果表明,该方法在景区路径规划中表现出良好的稳定性和高效性。Due to the complexity 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 forward the improved ant colony algorithm,and designed breeding ants,visual ants and common 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 condition,updated the pheromone of the appropriate path.Combined with simulated annealing algorithm,repeatedly receiving or rejecting the ants＇ path at every state,then got the global optimized path.Simulation results show that the path planning in the scenic area has good stability and high efficiency.

关 键 词：路径规划 蚁群算法 模拟退火算法 繁殖蚂蚁 视觉蚂蚁 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]