一种新的可调时间窗车辆调度问题研究  

A new vehicle scheduling problem with adjustable time window

作　　者：于青[1] 

机构地区：[1]天津大学计算机科学与技术学院

出　　处：《天津师范大学学报（自然科学版）》2008年第2期77-80,共4页Journal of Tianjin Normal University：Natural Science Edition

基　　金：天津市科技发展计划项目(07ZCKFGX02500);天津市高等学校科技发展基金计划项目(20061006)

摘　　要：提出了一种新的时间窗可调整的车辆调度模型,设计了求解该问题的算法.设计了初始路径的构造算法、时间窗的分配以及动态调整策略和初始路径的禁忌搜索改进策略.实验计算表明,禁忌搜索算法能够显著改进初始解的质量,有效降低了运输成本,时间窗可调策略能够为顾客提供多个参考时间窗选择,增加了车辆调度的灵活性.与固定时间窗算法相比,本算法能够提高服务质量,不会产生拒绝顾客服务要求的现象.A new vehicle scheduling model with adjustable time window is proposed, and the algorithm is developed. The construction algorithm of initial routings, assigning and dynamic adjusting method of time windows and tabu search for improving the initial routing are designed. The simulation results show that the tabu search can improve the initial solution and decrease the transport cost. The customer can be provided with many time windows and the flexibility of vehicle scheduling improves. Compared with the algorithm with fixed time window, the quality of service improves and nobody is rejected bv usina this alaorithm.

关 键 词：车辆路径 可调整时间窗 禁忌搜索 

分 类 号：O116.2[理学—数学]