期刊
NETWORKS
卷 58, 期 4, 页码 241-254出版社
WILEY
DOI: 10.1002/net.20467
关键词
split delivery vehicle routing problem; unlimited and limited fleet; column generation; branch-and-price-and-cut method
In this article we present a branch-and-price-and-cut method for the solution of the split delivery vehicle routing problem (SDVRP). The SDVRP is the problem to serve customers with a fleet of capacitated vehicles at minimum traveling cost. With respect to the classical vehicle routing problem, where each customer is visited exactly once, in the SDVRP a customer may be visited any number of times. The exact method we propose is based on a decomposition of the problem where the possible routes, with the delivery quantities, are generated in the sub-problem. The generated routes are also used to find a heuristic solution to the problem. We consider both the case where the fleet of vehicles is unlimited and the case where the fleet is limited to the minimum possible number of vehicles. We solve to optimality instances with larger size with respect to previous approaches, find new best solutions to several benchmark instances and reduce the optimality gap on most of the benchmark instances. (C) 2011 Wiley Periodicals, Inc. NETWORKS, Vol. 58(4), 241-254 2011
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据