Exact Branch-Price-and-Cut Algorithms for Vehicle Routing

Luciano Costa (), Claudio Contardo () and Guy Desaulniers ()
Additional contact information
Luciano Costa: Department of Mathematics and Industrial Engineering, Polytechnique Montréal, Montréal, Québec H3T 1J4, Canada; Group for Research in Decision Analysis (GERAD), HEC Montréal 3000, Québec H3T 2A7, Canada
Claudio Contardo: Group for Research in Decision Analysis (GERAD), HEC Montréal 3000, Québec H3T 2A7, Canada; Department of Management and Technology, ESG UQÀM, Montréal, Québec H2X 3X2, Canada; CIRRELT, Universite de Montréal, Montréal, Québec H3T 1J4, Canada
Guy Desaulniers: Department of Mathematics and Industrial Engineering, Polytechnique Montréal, Montréal, Québec H3T 1J4, Canada; Group for Research in Decision Analysis (GERAD), HEC Montréal 3000, Québec H3T 2A7, Canada

Transportation Science, 2019, vol. 53, issue 4, 946–985

Abstract: Vehicle routing problems (VRPs) are among the most studied problems in operations research. Nowadays, the leading exact algorithms for solving many classes of VRPs are branch-price-and-cut algorithms. In this survey paper, we highlight the main methodolog

Keywords: branch-price-and-cut; vehicle routing; survey; generic tools; variant-specific contributions (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (59)

Downloads: (external link)
https://doi.org/10.1287/trsc.2018.0878 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:53:y:2019:i:4:p:946-985

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().