DMCA
A robust branch-and-cut-and-price algorithm for the . . .
BibTeX
@MISC{Pessoa_arobust,
author = {Artur Pessoa and Eduardo Uchoa and Marcus Poggi De Aragão},
title = { A robust branch-and-cut-and-price algorithm for the . . . },
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The columns in the formulation are associated to q-routes, a relaxation of capacitated elementary routes that makes the pricing problem solvable in pseudo-polynomial time. Powerful new families of cuts are also proposed, which are expressed over a very large set of variables. Those cuts do not increase the complexity of the pricing subproblem. Experiments are reported where instances with up to 75 vertices were solved to optimality, a major improvement with respect to previous algorithms.
Keyphrases
robust branch-and-cut-and-price algorithm pricing problem capacitated elementary route heterogeneous fleet vehicle routing problem large set powerful new family previous algorithm pseudo-polynomial time robust branch-cut-and-price algorithm distinct capacity major improvement pricing subproblem
