The Capacitated VRP with Unequal Demands
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.
KeywordsDemand Point Vehicle Capacity Single Vehicle Item Size Capacitate Vehicle Route Problem
Unable to display preview. Download preview PDF.