Vehicle Routing with Time Windows

A. W. J. Kolen, A. H. G. Rinnooy Kan, H. W. J. M. Trienekens

Operations Research · 1987 · Volume 35 · Issue 2

Abstract

In vehicle routing problems with time windows, a fixed fleet of vehicles of limited capacity is available at a depot to serve a set of clients with given demands. Each client must be visited within a given time window. We describe a branch-and-bound method that minimizes the total route length, and present some computational results.

Keywords

627 branch-and-bound, 837 routing with time windows

Enable JavaScript for citation tools and additional paper interactions.