Skip to main content
SpringerLink
Log in

Local search in routing problems with time windows

  • Combinatorial Optimization
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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. A. Croes, A method for solving traveling salesman problems, Oper. Res. 5(1958)791.

    Google Scholar 

  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. P.C. Kanellakis and C.H. Papadimitriou, Local search for the asymmetric traveling salesman problem, Oper. Res. 28(1980)1086.

    Google Scholar 

  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. S. Lin, Computer solutions to the traveling salesman problem, Bell System Tech. J. 44(1965)2245.

    Google Scholar 

  7. S. Lin and B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem, Oper. Res. 21(1973)498.

    Google Scholar 

  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).

  9. C.H. Papadimitriou and K. Steiglitz, Some examples of difficult traveling salesman problems, Oper. Res. 26(1978)434.

    Google Scholar 

  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. 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. 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).

  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).

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research and System Theory, Centre for Mathematics and Computer Science, Kruislaan 413, NL-1098 SJ, Amsterdam, The Netherlands

    M. W. P. Savelsbergh

Authors
  1. M. W. P. Savelsbergh
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Savelsbergh, M.W.P. Local search in routing problems with time windows. Ann Oper Res 4, 285–305 (1985). https://doi.org/10.1007/BF02022044

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02022044

Keywords and phrases

Search

Navigation