Rich vehicle routing with auxiliary depots and anticipated deliveries: An application to pharmaceutical distribution
Rich vehicle routing with auxiliary depots and anticipated deliveries: An application to pharmaceutical distribution
复制标题
DOI：
10.1016/j.tre.2019.07.012
复制
发表时间：
2019-09-01
影响因子：
10.6
通讯作者：
Iori, Manuel
中科院分区：
文献类型：
--
作者：
Kramer, Raphael;Cordeau, Jean-Francois;Iori, Manuel
我们提出并解决了一个基于第三方物流供应商所面临的实际配送问题的富车辆路线问题，该第三方物流供应商的目标是向托斯卡纳的医疗机构交付药品。该问题的特点是具有多个仓库、异构车队、灵活的时间窗口、周期性需求、车辆和客户之间的不兼容性、路线的最长持续时间以及每条路线的最大客户数量。为了解决这一问题，提出了一种利用多个邻域的多起点迭代局部搜索算法。该算法已经在大量实例上进行了测试，无论是在实际案例研究上还是在大量人工生成的实例上都取得了良好的效果。
We present and solve a rich vehicle routing problem based on a practical distribution problem faced by a third-party logistics provider, whose aim is to deliver pharmaceutical products to healthcare facilities in Tuscany. The problem is characterized by having multiple depots, a heterogeneous fleet of vehicles, flexible time windows, periodic demands, incompatibilities between vehicles and customers, a maximum duration for the routes, and a maximum number of customers per route. A multi-start iterated local search algorithm making use of several neighborhoods is proposed to solve the problem. The algorithm has been tested on a large number of instances and obtained good results, both on the real case study and on a number of artificially generated instances.