Vehicle routing with time windows. (English) Zbl 0636.90047

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

Oper. Res. 35, 266-273 (1987).

Summary: 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.

MSC:

90B35	Deterministic scheduling theory in operations research
65K05	Numerical mathematical programming methods

Keywords:

vehicle routing; time windows; fixed fleet of vehicles of limited capacity; branch-and-bound; total route length