Annals of Operations Research

, Volume 4, Issue 1, pp 285–305

Local search in routing problems with time windows

  • M. W. P. Savelsbergh
Combinatorial Optimization

Abstract

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.

Keywords and phrases

Local search vehicle routing problem traveling salesman problem k-interchange NP-completeness computational complexity time windows heuristics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    N. Christofides, A. Mingozzi and P. Toth, Space state relaxation procedures for the computation of bounds to routing problems, Networks 11(1981)145.Google Scholar
  2. [2]
    A. Croes, A method for solving traveling salesman problems, Oper. Res. 5(1958)791.Google Scholar
  3. [3]
    M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).Google Scholar
  4. [4]
    P.C. Kanellakis and C.H. Papadimitriou, Local search for the asymmetric traveling salesman problem, Oper. Res. 28(1980)1086.Google Scholar
  5. [5]
    E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys (eds.),The Traveling Salesman Problem (Wiley, Chichester, 1985).Google Scholar
  6. [6]
    S. Lin, Computer solutions to the traveling salesman problem, Bell System Tech. J. 44(1965)2245.Google Scholar
  7. [7]
    S. Lin and B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Oper. Res. 21(1973)498.Google Scholar
  8. [8]
    I. Or,Traveling Salesman-type Combinatorial Problems and Their Relation to the Logistics of Blood Banking, Ph.D. Thesis, Dept. of Industrial Engineering and Management Sciences, Northwestern University (1976).Google Scholar
  9. [9]
    C.H. Papadimitriou and K. Steiglitz, Some examples of difficult traveling salesman problems, Oper. Res. 26(1978)434.Google Scholar
  10. [10]
    H.N. Psaraftis,k-interchange procedures for local search in a precedence-constrained routing problem, Eur. J. Oper. Res. 13(1983)391.Google Scholar
  11. [11]
    T.H.C. Smith and G.L. Thompson, A LIFO implicit enumeration search algorithm for the symmetric traveling salesman problem using Held and Karp's 1-tree relaxarion, Ann. Discrete Math. 1(1977)479.Google Scholar
  12. [12]
    M.M. Solomon, Vehicle routing and scheduling with time window constraints: Models and algorithms, Working Paper 83-02-01, Dept. of Decision Sciences, University of Pennsylvania (1983).Google Scholar
  13. [13]
    M.M. Solomon, On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints, Working Paper 83-05-03, Dept. of Decision Sciences, University of Pennsylvania (1983).Google Scholar

Copyright information

© J.C. Baltzer A.G., Scientific Publishing Company 1985

Authors and Affiliations

  • M. W. P. Savelsbergh
    • 1
  1. 1.Department of Operations Research and System TheoryCentre for Mathematics and Computer ScienceAmsterdamThe Netherlands

Personalised recommendations