论文标题
杂货送货服务的计算方法
Computational Approaches for Grocery Home Delivery Services
论文作者
论文摘要
杂货店送货服务要求客户在交货到达时出席。因此，杂货零售商和客户必须在可以保证交货的时间窗口中相互同意。这个概念被称为参加的送货上门（AHD）问题。客户通常通过Web服务下订单的阶段构成了该服务背后的后勤过程中最具挑战性的部分。系统必须确定可以提供给传入客户的潜在交货时间窗口，并在下达新订单时逐步构建交货时间表。通常，随时间窗口形成了基础优化问题的车辆路由问题。这项工作涉及国际杂货零售商在线购物服务的用例。我们介绍了可用于AHD服务的有效解决方案方法的分析。我们提供了几种启发式方法来解决上述步骤。但是，可以轻松地将基本框架用于许多类似的车辆路由应用。我们提供了一项全面的计算研究，比较了几种算法策略，并利用本地搜索操作和混合企业线性程序结合了启发式方法，以解决预订过程。最后，我们分析了方法的可伸缩性和适用性。
Grocery home delivery services require customers to be present when their deliveries arrive. Hence, the grocery retailer and the customer must mutually agree on a time window during which the delivery can be guaranteed. This concept is referred to as the Attended Home Delivery (AHD) problem. The phase during which customers place orders, usually through a web service, constitutes the computationally most challenging part of the logistical processes behind such services. The system must determine potential delivery time windows that can be offered to incoming customers and incrementally build the delivery schedule as new orders are placed. Typically, a Vehicle Routing Problem with Time Windows forms the underlying optimization problem. This work is concerned with the use case given by an international grocery retailer's online shopping service. We present an analysis of efficient solution methods that can be employed to AHD services. We provide several heuristic approaches for tackling the steps mentioned above. However, the basic framework can be easily be adapted to be used for many similar Vehicle Routing applications. We provide a comprehensive computational study comparing several algorithmic strategies, combining heuristics utilizing Local Search operations and Mixed-Integer Linear Programs, tackling the booking process. Finally, we analyze the scalability and suitability of the approaches.
