Title: Fleet Sizing for the Flash Delivery Problem from Multiple Depots a Case Study in Amsterdam Show Chinese title

Title: 多个仓库的闪送配送问题的车队规模优化 以阿姆斯特丹为例

Abstract: In this paper, we present a novel approach for fleet sizing in the context of flash delivery, a time-sensitive delivery service that requires the fulfilment of customer requests in minutes. Our approach effectively combines individual delivery requests into groups and generates optimized operational plans that can be executed by a single vehicle or autonomous robot. The groups are formed using a modified routing approach for the flash delivery problem. Combining the groups into operational plans is done by solving an integer linear problem. To evaluate the effectiveness of our approach, we compare it against three alternative methods: fixed vehicle routing, non-pooled deliveries and a strategy encouraging the pooling of requests. The results demonstrate the value of our proposed approach, showcasing its ability to optimize the fleet and improve operational efficiency. Our experimental analysis is based on a real-world dataset provided by a Dutch retailer, allowing us to gain valuable insights into the design of flash delivery operations and to analyze the effect of the maximum allowed delay, the number of stores to pick up goods from and the employed cost functions. Show Chinese abstract

Abstract: 在本文中，我们提出了一种新的方法，用于闪送服务中的车队规模设计，这是一种时间敏感的配送服务，要求在几分钟内完成客户请求。 我们的方法有效地将单独的配送请求组合成组，并生成可以由单个车辆或自主机器人执行的优化运营计划。 这些组是通过修改后的闪送问题路由方法形成的。 将这些组组合成运营计划是通过求解一个整数线性问题来完成的。 为了评估我们方法的有效性，我们将它与三种替代方法进行比较：固定车辆路线、未合并的配送以及一种鼓励请求合并的策略。 结果展示了我们所提出方法的价值，展示了其优化车队和提高运营效率的能力。 我们的实验分析基于一家荷兰零售商提供的真实数据集，使我们能够深入了解闪送运营的设计，并分析最大允许延迟、需要取货的商店数量以及使用的成本函数的影响。