期刊
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
卷 21, 期 1, 页码 153-175出版社
WILEY
DOI: 10.1111/itor.12041
关键词
generalized vehicle routing problem; column generation; splitting procedure; iterated local search; humanitarian logistics; disaster response
The generalized vehicle routing problem with flexible fleet size (GVRP-flex) extends the classical capacitated vehicle routing problem (CVRP) by partitioning the set of required nodes into clusters and has interesting applications such as humanitarian logistics. The problem aims at minimizing the total cost for a set of routes, such that each cluster is visited exactly once and its total demand is delivered to one of its nodes. An exact method based on column generation (CG) and two metaheuristics derived from iterated local search are proposed for the case with flexible fleet size. On five sets of benchmarks, including a new one, the CG approach often provides good upper and lower bounds, whereas the metaheuristics find, in a few seconds, solutions with small optimality gaps.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据