Local search in routing problems with time windows
- Cite this article as:
- Savelsbergh, M.W.P. Ann Oper Res (1985) 4: 285. doi:10.1007/BF02022044
- 1.1k Downloads
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.