论文信息 - Local search in routing problems with time windows

Local search in routing problems with time windows

We develop local search algorithms for routing problems with time windows. The presented algorithms are based on thek-interchange concept. The presence of time windows introduces feasibility constraints, the checking of which normally requires O(N) time. Our method reduces this checking effort to O(1) time. We also consider the problem of finding initial solutions. A complexity result is given and an insertion heuristic is described.

Martin W. P. Savelsbergh | M. Savelsbergh

[1] G. Croes. A Method for Solving Traveling-Salesman Problems , 1958 .

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

[3] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[4] T. H. C. Smith,et al. A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation , 1977 .

[5] Kenneth Steiglitz,et al. Some Examples of Difficult Traveling Salesman Problems , 1978, Oper. Res..

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] Christos H. Papadimitriou,et al. Local Search for the Asymmetric Traveling Salesman Problem , 1980, Oper. Res..

[8] Paolo Toth,et al. State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

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

[10] Marius Mihai Solomon,et al. VEHICLE ROUTING AND SCHEDULING WITH TIME WINDOW CONSTRAINTS: MODELS AND ALGORITHMS (HEURISTICS) , 1984 .

[11] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .

[12] Marius M. Solomon,et al. On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints , 1986, Networks.