An Exchange Heuristic for Routeing Problems with Time Windows
比较了多种交换启发式方法在带时间窗车辆路径问题上的表现，提出一种新的2-opt*交换启发式，并发现结合Or-opt和2-opt*的混合方法对时间窗问题特别有效。
In this paper, we compare different exchange heuristics for vehicle routeing problems with time windows. We also introduce a new 2-opt* exchange heuristic, and show that a hybrid approach, based on Or-opt and 2-opt* exchanges, is particularly powerful for problems with time windows. Computational results are reported for randomly generated problems and for a standard test set.