2005, Volume 7, Issue 12
Strategic Study of CAE >> 2005, Volume 7, Issue 12
Application Research on Vehicle Routing Problem With Time Windows Based on Dynamic Ant Algorithm
Management School of Xi'an Jiaotong University, Xi'an 710049, China
Next Previous
Abstract
Ant algorithm is a newly emerged stochastic searching optimization algorithm in recent years. It has been paid much attention to since the successful application in the famous traveling salesman problem. This paper further extends the idea of this new biological optimization strategy to vehicle routing problem with time windows in logistic management and designs a new kind of dynamic ant algorithm. The ability of optimization of this new ant algorithm is tested through numerical computation which gives encouraging results.
Figures
图1
图2
References
[ 1 ] Dorigo M, Maniezzo V, Colorni A.Ant system:optimization by a colony of cooperative agents[J].IEEE Trans on Systems, Man, and Cybernetics, 1996, 26 (1) :29~41
[ 2 ] Dorigo M, Gambardella L M.Ant colony system:acooperative learning approach to the traveling salesmanproblem[J].IEEE Trans on EvolutionaryComputation, 1997, 1 (1) :53~66
[ 3 ] 马良, 项培军.蚁群算法在组合优化中的应用[J].管理科学学报, 2001, 4 (2) :32~37 link1
[ 4 ] 张丽萍, 柴跃廷, 曹瑞.有时间窗车辆路径问题的改进遗传算法[J].计算机集成制造系统———CIMS, 2002, 8 (6) :451~454 link1
[ 5 ] 冷德惠, 张金海, 李大卫.遗传算法在有时间窗车辆路径问题上的应用[J].鞍山钢铁学院学报, 2001, 22 (3) :129~132 link1
[ 6 ] 李大卫, 王莉, 王梦光.遗传算法在有时间窗车辆路径问题上的应用[J].系统工程理论与实践, 1999, (8) :65~69
[ 7 ] 李军.有时间窗的车辆调度问题的网络启发式算法[J].系统工程, 1999, 17 (2) :66~71 link1
[ 8 ] 李军.车辆调度问题的分派启发式算法[J].系统工程理论与实践, 1999, (1) :27~33 link1
[ 9 ] 李军.有时间窗的车辆路线安排问题的启发式算法[J].系统工程, 1996, 14 (5) :45~50 link1
[10] 李大卫, 王莉, 王梦光.一个求解有时间窗口约束的车辆路径问题的启发式算法[J].系统工程, 1998, 16 (4) :20~24, 29 link1
京公网安备 11010502051620号
