The Capacitated VRP with Unequal Demands

  • Julien Bramel
  • David Simchi-Levi
Part of the Springer Series in Operations Research book series (ORFE)


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.


Demand Point Vehicle Capacity Single Vehicle Item Size Capacitate Vehicle Route Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York, Inc. 1997

Authors and Affiliations

  • Julien Bramel
    • 1
  • David Simchi-Levi
    • 2
  1. 1.Management Science Division Graduate School of BusinessColumbia UniversityNew YorkUSA
  2. 2.Department of Industrial Engineering and Management SciencesNorthwestern UniversityEvanstonUSA

Personalised recommendations