首页 | 本学科首页   官方微博 | 高级检索  
     

基于改进蚁群算法的车辆路径优化问题研究
引用本文:陈迎欣.基于改进蚁群算法的车辆路径优化问题研究[J].计算机应用研究,2012,29(6):2031-2034.
作者姓名:陈迎欣
作者单位:哈尔滨工程大学 经济管理学院,哈尔滨,150001
基金项目:黑龙江省哲学社会科学基金资助项目(08E004);中央高校基本业务费专项基金资助项目(HEUCF120910)
摘    要:物流活动中需要找出各个配货节点之间的最短路径,用以指导物流车辆调度,进而节约物流成本。提出解决车辆路径优化问题的方法,针对蚁群算法的缺点,分别对信息素更新策略、启发因子进行改进,并引入搜索热区机制,有效解决了蚁群算法的缺陷。最后,以哈尔滨市局部地图为原型,应用MATLAB软件对改进蚁群算法求解车辆路径优化问题的性能进行仿真,并与基本蚁群算法对比分析,验证了改进蚁群算法的有效性和可行性。

关 键 词:蚁群算法  车辆路径优化  信息素  物流

Study on VRP based on improved ant colony optimization
CHEN Ying-xin.Study on VRP based on improved ant colony optimization[J].Application Research of Computers,2012,29(6):2031-2034.
Authors:CHEN Ying-xin
Affiliation:School of Economics & Management, Harbin Engineering University, Harbin 150001, China
Abstract:Logistics activities need to find different distribution node of the shortest path, to instruct the logistics vehicle scheduling, and then save the logistics cost. This paper proposed the solution of vehicle routing optimization problem. In order to conquer the defects and improve the basic ant colony optimization, it improved pheromones updating strategy, stimulating factor and the introduction of search hotspots, solved the defects of ant colony optimization effectively. With the help of Harbin city map as the prototype and the MATLAB software, it carried out simulation to check the improved ant colony optimization. The result verifies the feasibility and effectiveness of the improved ant colony optimization.
Keywords:ant colony optimization  vehicle routing problem(VRP)  pheromone  logistics
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号