This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have various capacities and fixed 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 up to 75 vertices were solved to optimality, a major improvement with respect to previous algorithms. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Pessoa, A., De Aragão, M. P., & Uchoa, E. (2007). A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4525 LNCS, pp. 150–160). Springer Verlag. https://doi.org/10.1007/978-3-540-72845-0_12
Mendeley helps you to discover research relevant for your work.