...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Transportation Research Part B: Methodological >Towards delivery-as-a-service: Effective neighborhood search strategies for integrated delivery optimization of E-commerce and static O2O parcels
【24h】

Towards delivery-as-a-service: Effective neighborhood search strategies for integrated delivery optimization of E-commerce and static O2O parcels

机译：向交付 - AS-A-Serve：电子商务和静态O2O包裹的综合交付优化的有效邻居搜索策略

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we investigate a new variant of last-mile delivery that integrates the scheduling of static E-commerce parcels and Online-to-Offline(O2O) parcels. The O2O parcels, such as flowers and cakes, are often delivered intra city with a time window constraint. It is driven by the concept of delivery-as-a-service, which targets at building consolidated infrastructure and using the same fleet of vehicles to provide standardized delivery services for different types of merchants. We formulate it as an integration of Multi-Depot Multi-Trip Vehicle Routing Problem (MDMTVRP) and Paired Pickup and Delivery Problem with Time Window (PPDPTW). To solve the mixed problem of MDMT VRP and PPDPT W, we present its Mixed-Integer Programming (MIP) model to obtain the optimal solution for small-scale instances. To solve large-scale problems, we propose a hybrid neighborhood search strategy to effectively combine the merits of ALNS and tabu search. We also present a two-level pruning strategy that can significantly accelerate the local search procedure. We conduct extensive numeric experiments on multiple datasets, and results showed that our hybrid approach achieved near-optimal performance and established clear superiority over ALNS and tabu search. (C) 2020 Elsevier Ltd. All rights reserved.
机译：在本文中，我们调查了最后一英里交付的新变种，可以集成静态电子商务包和在线到脱机（O2O）包裹的调度。鲜花和蛋糕等O2O包裹通常随着时间窗口约束来交付墨风中的城市。它是由交付服务的概念驱动，在建立综合基础设施和使用同一车辆车辆中的目标，为不同类型的商家提供标准化的送货服务。我们将其作为与时间窗口（PPDPTW）的多仓多跳动车辆路由问题（MDMTVRP）和配对拾取和交付问题的集成。为了解决MDMT VRP和PPDPT W的混合问题，我们提出了其混合整数编程（MIP）模型，以获得小规模实例的最佳解决方案。为了解决大规模问题，我们提出了一个混合邻域搜索策略，以有效地结合ALN和Tabu搜索的优点。我们还提供了一种两级修剪策略，可以显着加速本地搜索程序。我们对多个数据集进行广泛的数值实验，结果表明，我们的混合方法实现了近乎最佳的性能，并在ALN和Tabu搜索方面建立了清晰的优越性。 （c）2020 elestvier有限公司保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号