考虑成对取送点的O2O订单配送路径优化  

Delivery routing optimization problem for O2O orders with paired pick-up and delivery nodes

作　　者：马艳芳[1] 赵媛媛 周晓阳 杨屹夫 Ma Yanfang;Zhao Yuanyuan;Zhou Xiaoyang;Yang Yifu(School of Economics and Management,Hebei University of Technology,Tianjin 300401,China;School of Management,Xi’an Jiaotong University,Xi’an 710049,China;Research Center of Logistics,Nankai University,Tianjin 300071,China)

机构地区：[1]河北工业大学经济管理学院,天津300401 [2]西安交通大学管理学院,陕西西安710049 [3]南开大学现代物流研究中心,天津300071

出　　处：《系统工程学报》2024年第6期801-820,共20页Journal of Systems Engineering

基　　金：国家自然科学基金资助项目(72202056,72271194);陕西重点研发计划资助项目(2023GXLH-036);国家社会科学基金后期资助项目(21FGLB032);河北省燕赵黄金台聚才计划骨干人才项目(HJYB202532).

摘　　要：针对O2O订单取送货点成对出现且先取货后送货的情况,同时考虑多车型、多行程、顾客时间窗等实际配送约束,以配送总成本最小化为目标构建O2O订单配送路径优化模型.为求解该模型,提出结合邻域搜索的模拟退火算法(ISA-NS),设计独特的编码方式满足订单优先级、成对和多车型约束,采用贪心策略构造初始解,并引入3种邻域搜索算子扩展算法的搜索范围.求解小规模与大规模基准案例,ISA-NS算法的解接近于现存最优解,这验证了该算法的有效性及收敛性.最后,以天津“货拉拉”平台的O2O订单为例优化配送路径,验证模型和算法的可行性.Considering that O2O orders consist of paired pickups which often occurs before delivering them,as well as constraints like multi-type vehicles,multi-trip and customer time windows,a delivery routing optimiza-tion model is constructed for O2O orders.Then,an improved simulated annealing algorithm with neighborhood search(ISA-NS)is proposed,where a unique encoding method,greedy strategy,and three NS operators are adopted.When solving small-size and large-size benchmarks,the solution of ISA-NS algorithm is close to the existing optimal solution,which verifies the effectiveness and convergence of the algorithm.Finally,the opti-mization results,taking the O2O orders of Tianjin“Huo lala”platform as an example,illustrate the applicability of the model and algorithm.This provides decision support for the O2O order delivery problem.

关 键 词：O2O订单 配送路径优化 模拟退火算法 邻域搜索算子 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]