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 wi and the capacity constraint stipulates that the total amount delivered by a single vehicle cannot exceed Q. We let Zu∗ denote the optimal solution value of UCVRP, that is, the minimal total distance traveled by all vehicles.
Author supplied keywords
Cite
CITATION STYLE
APA
Simchi-Levi, D., Chen, X., & Bramel, J. (2014). The Capacitated VRP with Unequal Demands. In Springer Series in Operations Research and Financial Engineering (pp. 313–339). Springer Nature. https://doi.org/10.1007/978-1-4614-9149-1_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free