Efficient heuristics for vehicle routing problems with time-dependent travel times
Mingwei Hu · JOURNAL OF SHENZHEN UNIVERSITY SCIENCE AND ENGINEERING · 2009
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 Or-opt,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.