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

基于改进蚁群算法的有时间窗车辆路径优化
引用本文:吴隽,陈定方,李文锋,胡俊杰.基于改进蚁群算法的有时间窗车辆路径优化[J].湖北工业大学学报,2008,23(3):9-12.
作者姓名:吴隽  陈定方  李文锋  胡俊杰
作者单位:武汉理工大学计算机科学与技术学院,湖北,武汉,430062;武汉理工大学物流工程学院,湖北,武汉,430062;湖北省现代制造质量工程重点实验室,湖北,武汉,430068;武汉理工大学物流工程学院,湖北,武汉,430062
摘    要:针对物流配送中的有时间窗车辆路径问题(VRPTW),提高优化性能,提出了一种改进的最大最小蚁群算法,并引入了局部搜索策略2-opt.在客户数目给定的情况下,本算法能够得到所求VRPTW的全局较优解,与基本蚁群算法和未改进的最大最小蚁群算法比较,具有更快的收敛速度和更高的收敛精度,并可扩展到一类相关的路径优化问题中.实验结果表明,本算法对于求解VRPTW效果很明显.

关 键 词:有时间窗的车辆路径问题  蚁群算法  最大最小蚁群算法
文章编号:1003-4684(2008)03-0009-04
修稿时间:2007年12月1日

An Improved Ant Colony Algorithm for Vehicle Routing Problem with Time Windows
WU Jun,CHEN Ding-fang,LI Wen-feng,HU Jun-jie.An Improved Ant Colony Algorithm for Vehicle Routing Problem with Time Windows[J].Journal of Hubei University of Technology,2008,23(3):9-12.
Authors:WU Jun  CHEN Ding-fang  LI Wen-feng  HU Jun-jie
Affiliation:WU Jun, CHEN Ding-fang, LI Wen-feng, HU Jun-jie (1 School of Computer Sci. and Technology, Wuhan Univ. of Technology ,Wuhan 430062, China; 2 School of Logistic Engin. ,Wuhan Univ. of Technology ,Wuhan 430062 ,China ; 3 Key Laboratory of Modern Manufacturing Quality Engin. of Hubei Province, Wuhan 430068,China)
Abstract:To solve the vehicle routing problem with time windows,an improved ant colony algorithm is presented in this paper.In order to improve the performance of optimization,the proposed algorithm is the improvement on the Max-Min ant system and adopts a kind of local searching strategy-2-opt.Given the custom number,the algorithm can obtain the preferable global solving result.Compared with other two algorithms,the ant colony algorithm and the Max-Min ant system,the proposed algorithm can make the result converge to the global optimum faster and has higher accuracy.The algorithm can also be extended to solve other correlative routing optimization problems.Experimental results indicate the evident validity of the proposed algorithm.
Keywords:vehicle routing problem with time Windows  ant colony algorithm  MAX-MIN ant system
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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