论文标题
一种四阶段的启发式算法，用于解决按需膳食交付路线问题
A Four-stage Heuristic Algorithm for Solving On-demand Meal Delivery Routing Problem
论文作者
论文摘要
具有集成交付系统的平台提供的餐饮服务越来越流行。本文采用了滚动范围的方法来解决餐点交付路由问题（MDRP）。为了提高交付需求较高的方案的交付效率，可以将多个订单组合成一个捆绑包，并与来自不同餐厅的订单相结合。遵循此策略，开发了一种基于优化的四阶段启发式算法，以在每个决策点生成最佳路由计划。该算法首先根据订单的空间和时间分布生成捆绑包。其次，我们发现可行的束对。然后，分别优化了用于交付任何单个捆绑包或多个捆绑包的路由。最后，将路线分配给可用的快递员。在使用“开放数据集中的实例”实例进行的计算实验中，对系统的性能进行了平均点击时间和预售时间的评估。我们证明，该算法可以有效地处理实时信息并将最佳路线分配给快递员。通过将提出的方法与现有的现有算法进行比较，结果表明我们的方法可以生成更高的服务质量和较短距离的解决方案。
Meal delivery services provided by platforms with integrated delivery systems are becoming increasingly popular. This paper adopts a rolling horizon approach to solve the meal delivery routing problem (MDRP). To improve delivery efficiency in scenarios with high delivery demand, multiple orders are allowed to be combined into one bundle with orders from different restaurants. Following this strategy, an optimization-based four-stage heuristic algorithm is developed to generate an optimal routing plan at each decision point. The algorithm first generates bundles according to orders' spatial and temporal distribution. Secondly, we find feasible bundle pairs. Then, routes for delivering any single bundle or multiple bundles are optimized, respectively. Finally, the routes are assigned to available couriers. In computational experiments using instances from open datasets, the system's performance is evaluated in respect of average click-to-door time and ready-to-pickup time. We demonstrate that this algorithm can effectively process real-time information and assign optimal routes to the couriers. By comparing the proposed method with existing the-state-of-the-art algorithms, the results indicate that our method can generate solutions with higher service quality and shorter distance.
