期刊
TRANSPORTATION SCIENCE
卷 53, 期 4, 页码 946-985出版社
INFORMS
DOI: 10.1287/trsc.2018.0878
关键词
branch-price-and-cut; vehicle routing; survey; generic tools; variant-specific contributions
资金
- Fonds de recherche du Quebec-Nature et technologies (FRQNT) [181909]
- Natural Sciences and Engineering Research Council (NSERC) of Canada [2017-05683, 2013-435824]
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 methodological and modeling contributions made over the years on branch-and-price (branch-price-and-cut) algorithms for VRPs, whether they are generic or specific to a VRP variant. We focus on problems related to the classical VRP-that is, problems in which customers must be served by several capacitated trucks and which are not combinations of a VRP and another optimization problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据