Vehicle Routing with Time Windows

A. W. J. Kolen, A. H. G. Rinnooy Kan and H. W. J. M. Trienekens
Additional contact information
A. W. J. Kolen: Erasmus University, Rotterdam, The Netherlands
A. H. G. Rinnooy Kan: Erasmus University, Rotterdam, The Netherlands
H. W. J. M. Trienekens: Erasmus University, Rotterdam, The Netherlands

Operations Research, 1987, vol. 35, issue 2, 266-273

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 (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (57)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.2.266 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:35:y:1987:i:2:p:266-273

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().