论文信息 - An Exchange Heuristic for Routeing Problems with Time Windows

An Exchange Heuristic for Routeing Problems with Time Windows

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.

Jean-Yves Potvin | Jean-Marc Rousseau | J. Potvin | J. Rousseau

[1] M M Solomon,et al. VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS: EFFICIENT IMPLEMENTATIONS OF SOLUTION IMPROVEMENT PROCEDURES , 1988 .

[2] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[3] Paul M. Thompson,et al. Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..

[4] Mandell Bellmore,et al. Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem , 1974, JACM.

[5] Jean-Yves Potvin,et al. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[6] J Potvin,et al. A tabu search heuristic for the vehicle routing problem with time windows , 1992 .

[7] Martin W. P. Savelsbergh,et al. Local search in routing problems with time windows , 1984 .

[8] J. Svestka,et al. Computational Experience with an M-Salesman Traveling Salesman Algorithm , 1973 .

[9] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[10] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .

[11] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[12] Harilaos N. Psaraftis,et al. k-Interchange procedures for local search in a precedence-constrained routing problem , 1983 .