Paper Info
Title
A Branch-and-Price Algorithm for the Vehicle Routing Problem with 2-Dimensional Loading Constraints.
Abstract
In this paper, we describe a branch-and-price algorithm for the capacitated vehicle routing problem with 2-dimensional loading constraints and a virtually unlimited number of vehicles. The column generation subproblem is solved heuristically through variable neighborhood search. Branch-and-price is used when it is not possible to add more attractive columns to the current restricted master problem, and the solution remains fractional. In order to accelerate the convergence of the algorithm, a family of valid dual inequalities is presented. Computational results are provided to evaluate the performance of the algorithm and to compare the different branching strategies proposed.
Year
Venue
Field
2016
ICCL
Convergence (routing),Multipath routing,Vehicle routing problem,Column generation,Heuristic,Mathematical optimization,Variable neighborhood search,Computer science,Static routing,Branch and price,Algorithm
DocType
Citations 
PageRank 
Conference
1
0.38
References 
Authors
6
3
Name
Order
Citations
PageRank
Telmo Pinto1192.51
Cláudio Alves218416.29
José M. Valério De Carvalho316814.06