| 一种改进蚁群算法研究和旅游景区路径规划问题求解* |
| |
| 引用本文： | 胡军国,祁亨年,董峰,汪杭军.一种改进蚁群算法研究和旅游景区路径规划问题求解*[J].计算机应用研究,2011,28(5):1647-1650. |
| |
| 作者姓名： | 胡军国 祁亨年 董峰 汪杭军 |
| |
| 作者单位： | 浙江农林大学,信息工程学院,浙江,临安,311300 |
| |
| 基金项目： | 国家自然科学基金资助项目 |
| |
| 摘 要： | 针对旅游景区路径规划问题的复杂性，把景区路径分为全景区图与子景区图，并归为同一问题解决。然后提出BVC蚁群算法，设计繁殖蚂蚁(Breeding ants)、视觉蚂蚁(Visual ants)和普通蚂蚁(Common ants)，各类蚂蚁按各自规则遍历。蚂蚁遍历完所有景点，求出最佳行程MIN(k,Pk,Lk)，并根据约束条件，对符合要求的路径上的信息素进行更新。再结合模拟退火算法，在每个状态对蚁群行程进行舍取，重复迭代，最终获得全局最优解。仿真实验结果表明,该方法在景区路径规划中,表现出良好的稳定性和高效性。
|
| 关 键 词： | 路径规划 蚁群算法 模拟退火算法 繁殖蚂蚁 视觉蚂蚁 |
| 收稿时间： | 2010/9/26 0:00:00 |
| 修稿时间： | 2010/11/15 0:00:00 |
Improved ant colony algorithm for path planning of tourist scenic area |
| |
| HU Jun-guo,QI Heng-nian,DONG Feng,WANG Hang-jun.Improved ant colony algorithm for path planning of tourist scenic area[J].Application Research of Computers,2011,28(5):1647-1650. |
| |
| Authors: | HU Jun-guo QI Heng-nian DONG Feng WANG Hang-jun |
| |
| Affiliation: | 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 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 ... |
| |
| Keywords: | path planning ant colony algorithm simulated annealing algorithm breeding ant visual ants |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
