The Vehicle Routing Problem with Divisible Deliveries and Pickups
The Vehicle Routing Problem with Divisible Deliveries and Pickups
复制标题
DOI：
10.1287/trsc.2013.0501
复制
发表时间：
2015-05
期刊：
影响因子：
--
通讯作者：
G. Nagy;Niaz A. Wassan;M. Speranza;C. Archetti
中科院分区：
文献类型：
--
作者：
G. Nagy;Niaz A. Wassan;M. Speranza;C. Archetti
配送和取货可分的车辆路径问题是逆向物流中一个新的有趣的模型。每个客户都可能有一个拾取和交付的需求，必须与能力有限的车辆服务。如果有益，可以在两次单独的访问中提供取件和交付数量。该模型被放置在其他交付和皮卡问题的背景下，并制定为一个混合整数线性规划问题。在本文中，我们研究的节省，可以通过允许皮卡和交付的数量分别提供服务的情况下，必须同时提供的数量。精确和启发式的结果进行了深入的分析，以更好地了解问题的结构和平均估计的节省，由于服务的皮卡和交付数量分开的可能性。
The vehicle routing problem with divisible deliveries and pickups is a new and interesting model within reverse logistics. Each customer may have a pickup and delivery demand that have to be served with capacitated vehicles. The pickup and the delivery quantities may be served, if beneficial, in two separate visits. The model is placed in the context of other delivery and pickup problems and formulated as a mixed-integer linear programming problem. In this paper, we study the savings that can be achieved by allowing the pickup and delivery quantities to be served separately with respect to the case where the quantities have to be served simultaneously. Both exact and heuristic results are analysed in depth for a better understanding of the problem structure and an average estimation of the savings due to the possibility of serving pickup and delivery quantities separately.