Abstract
In this chapter we consider the Capacitated Vehicle Routing Problem with unequal demands (UCVRP). In this version of the problem, each customer i has a demand W i and the capacity constraint stipulates that the total amount delivered by a single vehicle cannot exceed Q. We let Z *u denote the optimal solution value of UCVRP, that is, the minimal total distance traveled by all vehicles.
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 Capacitated VRP with Unequal Demands. In: The Logic of Logistics. Springer Series in Operations Research. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9309-2_6
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9309-2_6
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