计算机工程2012，Vol.38Issue(13)：137-141,5.DOI:10.3969/j.issn.1000-3428.2012.13.041
带时间窗动态车辆路径问题的优化调度策略
Optimization Schedule Strategy for Dynamic Vehicle Routing Problem with Time Window
摘要
Abstract
Aiming at the Dynamic Vehicle Routing Problem with Time Windows(DVRPTW), a series of static DVRPTW sub-models are established according to the optimization times, and four dynamic schedule strategies are provided to optimize the DVRPTW. Three of the strategies are based on a repeated reoptimization of various instances of the static problem, the batch optimization and a hybrid of both. The fourth is a new one called the emergency customer insertion and batch optimization strategy. This strategy only distinguishes the emergency customers and inserts them into real-time routing plan, and hence has the advantages of quick response, small computational load and low update frequency while routing the vehicles. Simulation experiments compare four strategies and discuss the impact of batch schedule intervals on the schedule performance.关键词
动态车辆路径问题/调度策略/批优化/实时优化/时间窗/紧急顾客Key words
Dynamic Vehicle Routing Problem(DVRP)/ schedule strategy/ batch optimization/ real-time optimization/ time window/ emergency customer分类
信息技术与安全科学引用本文复制引用
王君,李波,卢志刚..带时间窗动态车辆路径问题的优化调度策略[J].计算机工程,2012,38(13):137-141,5.基金项目
国家社科基金资助项目(11CGL102) （11CGL102）
新世纪优秀人才支持计划基金资助项目(NCET-06-0236) （NCET-06-0236）
高等学校博士学科点专项科研基金资助项目(20100032110034) （20100032110034）
天津财经大学科研发展基金资助项目(Y1110,Q1208) （Y1110,Q1208）
