深圳大学学报（理工版）2009，Vol.26Issue(3)：315-320,6.
时相关旅行时间车辆路径高效启发式算法
Efficient heuristics for vehicle routing problems with time-dependent travel times
摘要
Abstract
An efficient heuristics,which is improving classical heuristics for vehicle routing with time-dependent travel times through updating arrival and latest departure times,was proposed.The computational time of local search algorithms can be significantly reduced by the proposed method.The improved method can be used to Oropt,2-opt,1-shift,and CROSS exchanges.The simulation results indicate that the computational complexities of the proposed heuristics for both single-and multi-tour procedures are significantly reduced compared with the conventional heuristics.关键词
时相关车辆路径问题/启发式算法/智能交通系统/局部搜索算法/动态路径诱导Key words
time-dependent vehicle routing problem(TDVRP)/heuristics/intelligent transportation systems (ITS)/local search algorithm/dynamic route guidance分类
交通工程引用本文复制引用
胡明伟,唐浩..时相关旅行时间车辆路径高效启发式算法[J].深圳大学学报（理工版）,2009,26(3):315-320,6.基金项目
深圳市科技计划资助项目(SY200806270087A) （SY200806270087A）
