系统管理学报

Journal of Systems & Management ›› 2021, Vol. 30 ›› Issue (3): 584-591.DOI: 10.3969/j.issn.1005-2542.2021.03.018

Previous Articles     Next Articles

Vehicle Routing Problem with Hard Time Windows for Instant Delivery of O2O Fresh Takeout Orders

YU Haiyan，TANG Wanqian，WU Tengyu   

  1. 1. School of Economics and Management，Chongqing Jiaotong University，Chongqing 400074，China；2. Chongqing Key Laboratory of Intelligent Logistics Network，Chongqing 400074，China；3. School of Economics and Management，Chongqing University of Posts and Telecommunications，Chongqing 400065，China
  • Online:2021-05-28 Published:2021-06-16

带硬时间窗的O2O生鲜外卖即时配送路径优化

余海燕，唐婉倩，吴腾宇   

  1. 1.重庆交通大学 经济与管理学院，重庆 400074；2.智能物流网络重庆市重点实验室，重庆 400074；3重庆邮电大学 经济管理学院，重庆 400065
  • 通讯作者: 唐婉倩（1996-），女，硕士生
  • 作者简介:余海燕（1985-），女，副教授。研究方向为物流管理
  • 基金资助:
    国家自然科学青年基金资助项目( 71702016)， 重庆市教委科技项目（KJQN201900732）；智能物流网络重庆市重点实验室开放基金资助项目（KLILN2018005）

PDF

Abstract: Aimed at the characteristics of online to offline (O2O) fresh takeout orders with a high dynamic and strong timeliness of delivery service, an O2O instant delivery routing model with hard time window and minimization of distribution distance is established. According to the requirements of hard time window and the idea of combined delivery, a rolling time delay delivery algorithm is designed to solve the problem. A large number of numerical simulation experiments show that the algorithm is effective in both actual network and general simulation network. A sensitivity analysis of various parameters indicates that the rolling time length should not been designed too long or too short. Besides, the time window of the order has no obvious effect on the distribution distance. In order to shorten the distribution distance, the capacity of the car can be increased. The research results can provide theoretical guidance for the real-time distribution vehicle scheduling of fresh food enterprises.

Key words: hard time window；instant delivery；fresh food, online to offline (O2O)；vehicle routing problem

摘要： 针对线上到线下（O2O）生鲜外卖订单动态性高和配送服务时效性强的特征，建立以配送距离最小为目标，带硬时间窗的O2O生鲜外卖即时配送路径优化模型。根据硬时间窗的要求和合单配送思想，设计滚动时域延迟配送算法进行求解。通过大量数值仿真实验验证了该算法在实际网络与一般仿真网络中均具有有效性，并且配送距离比滚动时域非延迟配送算法短。通过对各项参数的敏感性分析，发现滚动时域时长不宜过长或过短，且订单的时间窗对配送距离的影响不明显。为了缩短配送距离，可以增加配送员车容量。研究结果可为生鲜企业的即时配送车辆调度提供理论指导。

关键词: 硬时间窗, 即时配送, 生鲜, O2O, 车辆路径问题

CLC Number: