李建斌1，徐礼平1，戴 宾2*
(1.华中科技大学管理学院，武汉430074；2.武汉大学 经济管理学院，武汉 430072)
摘 要：本文结合对卓尔集团旗下卓集送企业的实地调研和访谈，站在平台的角度，同时考虑司机和客户的需求，利用基于时间窗的同城零担集货匹配优化策略来合理地实现供需匹配。首先，结合卓集送公司零担业务的现状，提出操作性较强的零担集货匹配优化策略；其次综合考虑客户OD点对、订单时间窗、以及司机工作时间窗、起终点、车辆容量限制等因素，以服务总成本最小为优化目标，构建单位订单处理时间窗内某区域的半开放式多车场的带取送货和时间窗的车辆路径优化模型；最后，结合模型特性采用改进遗传算法，并选取卓集送公司的实例数据进行算例分析。结果表明，优化策略相比于现有的“抢单”模式可以有效地降低车辆服务总成本，提高车辆空间利用率，实现司机和客户双方的利益最大化。
关键词：零担集货；路径优化；取送货；时间窗；改进遗传算法
Matching Policy Optimization of City LCL Carpool Based on Time Windows under the Background of O2O
LI Jian-bin1, XU Li-ping1, DAI Bin2*
（1. School of Management, Huazhong University of Science and Technology, Wuhan 430074, China;
2. School of Economics and Management, Wuhan University, Wuhan 430072, China)
Abstract: Combining with field research and interview to the Zallsoon Enterprise, this paper simultaneously considers the demand of drivers and clients on platform’s side to propose the optimized matching policy of LCL carpool based on time windows in order to reasonably realize matching and planning. First, we propose the optimized policy according to the LCL operation’s status quo of Zallsoon Enterprise. Then under the premise of considering the factors of clients’ OD points, order time windows and drivers’ working time windows, start-end points and vehicle capacity, we start to construct the mathematical model which called the half-open multi-depot vehicle routing problem with pick-up and delivery and time windows, which aims at the lowest total service cost.
Finally, we use the improved genetic algorithm to solve it based on its features and select Zallsoon Enterprise’s practical data to confirm the superiority and feasibility. It proves indeed that the optimized matching policy of LCL carpool based on time windows can significantly reduce the total service cost, improve the vehicle space utilization and realize the maximization of interests of drivers and clients.
Key words: LCL carpool; route optimization; pick-up and delivery; time windows; improved genetic algorithm