Abstract
In many distribution systems each customer specifies, in addition to the load that has to be delivered to it, a period of time, called a time window, in which this delivery must occur. The objective is to find a set of routes for the vehicles, where each route begins and ends at the depot, serves a subset of the customers without violating the vehicle capacity and time window constraints, while minimizing the total length of the routes. We call this model the Vehicle Routing Problem with Time Windows (VRPTW).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Bramel, J., Simchi-Levi, D. (1997). The VRP with Time Window Constraints. In: The Logic of Logistics. Springer Series in Operations Research. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9309-2_7
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9309-2_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-9311-5
Online ISBN: 978-1-4684-9309-2
eBook Packages: Springer Book Archive