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

DOI: 10.1007/BF02022044

Cite this article as:
Savelsbergh, M.W.P. Ann Oper Res (1985) 4: 285. doi:10.1007/BF02022044

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 searchvehicle routing problemtraveling salesman problemk-interchangeNP-completenesscomputational complexitytime windowsheuristics

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