Solving the Single Vehicle Routing Problem with Variable Capacity

Louveaux, Francois V. and Salazar-Gonzalez, Juan-Jose (2016) Solving the Single Vehicle Routing Problem with Variable Capacity. Transportation Science, 50 (2). pp. 708-719. ISSN 0041-1655

Full text not available from this repository.


This paper considers the classical vehicle routing problem (VRP) where the vehicle capacity is not fixed. Indeed, at the moment of acquiring (or renting) the vehicle that will serve all customers, there is some freedom of choice. A larger vehicle capacity implies a lower total distance travelled but larger operating costs. The reverse is true for a smaller vehicle. This paper gives an approach to select the best capacity and the best route to minimize a function of the acquisition cost and travelled distance. We first consider an enumerative approach, which consists of solving a sequence of VRPs, starting from the one having the largest capacity. The number of VRPs to solve using this approach is unknown. Based on computational experiments, this number is mostly large in our benchmark instances. We then proceed to a direct approach based on the two-index formulation of the VRP. We introduce several valid inequalities that allow us to have an integer linear programming formulation of the VRP with fixed vehicle capacity. We describe separation procedures for these inequalities. We conclude with computational results that confirm the utility of these inequalities when solving benchmark VRP instances.

Item Type:
Journal Article
Journal or Publication Title:
Transportation Science
Uncontrolled Keywords:
?? vehicle routing problemunknown vehicle capacitybranch-and-cut algorithmalgorithmsmanagement science and operations researchtransportation ??
ID Code:
Deposited By:
Deposited On:
25 Jul 2018 09:10
Last Modified:
15 Jul 2024 18:02