马俊;张纪会;郭乙运;

• 1:青岛大学复杂性科学研究所
• 2:山东省工业控制技术重点实验室
• 3:青岛港国际股份有限公司

摘要(Abstract)：

针对带有随机旅行时间、随机服务时间及时间窗约束的车辆路径问题,建立了带修正策略的随机规划模型,并给出了两阶段求解方法。第一阶段运用改进遗传算法获取先验路径,第二阶段采用两种混合修正策略(分别记为A、B)调整"失败"的先验路径。混合修正策略A(B)通过随机模拟实验判断对当前顾客的延迟服务(对下一顾客的服务)是否会对该路径后续顾客造成大规模延迟服务,并采取相应的调整措施。基于Solomon算例进行了仿真实验,对小规模算例将仿真结果同CPLEX求解结果作对比;对大规模算例将仿真结果同已知最优解作对比。结果表明:所给算法可获得小规模算例的精确解,大规模算例的近似最优解。同时,对比不同策略下的仿真结果表明两种混合修正策略具有优越性,研究结果对随机车辆路径问题的求解具有一定的参考意义。

关键词(KeyWords)： 物流工程;车辆路径;随机旅行及服务时间;随机规划;混合修正策略;改进遗传算法

Abstract:

Keywords:

基金项目(Foundation): 国家自然科学基金项目(61673228,62072260);; 青岛市科技计划项目(21-1-2-16-zhz)

作者(Authors): 马俊;张纪会;郭乙运;

DOI: 10.19961/j.cnki.1672-4747.2021.04.039

参考文献(References)：

• [1] DANTZIG G, RAMSER J. The truck dispatching problem[J]. Management Science, 1959, 6(1):80-91. [2]赵红霞,刘高森,李愈.基于随机游走的分类垃圾回收最优路径规划[J].交通运输工程与信息学报, 2018,16(3):103-108. [3] BRAEKERS K, RAMAEKERS K, NIEUWENHUYSE I V. The vehicle routing problem:state of the art classification and review[J]. Computers&Industrial Engineering, 2016, 99:300-313. [4] OYOLA J, ARNTZEN H, WOODRUFF D L. The stochastic vehicle routing problem, a literature review,part I:models[J]. Euro Journal on Transportation&Logistics, 2018, 7(3):193-221. [5] OYOLA J, ARNTZEN H, WOODRUFF D L. The stochastic vehicle routing problem, a literature review,partⅡ:solution methods[J]. Euro Journal on Transportation&Logistics, 2017, 6(4):349-388. [6] GENDREAU M, JABALI O, REI W. Future research directions in stochastic vehicle routing[J]. Transportation science, 2016, 50(4):1163-1173. [7] MIRANDA D M, CONCEICAO S V. The vehicle routing problem with hard time windows and stochastic travel and service time[J]. Expert Systems with Applications,2016, 64:104-116. [8] ZHANG J L, LAM W H, CHEN B. A stochastic vehicle routing problem with travel time uncertainty:trade-off between cost and customer service[J]. Networks&Spatial Economics, 2013, 13(4):471-496. [9] MIRANDA D M, BRANKE J, CONCEICAO S V.Algorithms for the multi-objective vehicle routing problem with hard time windows and stochastic travel time and service time[J]. Applied Soft Computing, 2018, 70:66-79. [10] LI X Y, TIAN P, LEUNG S. Vehicle routing problems with time windows and stochastic travel and service times:models and algorithm[J]. International Journal of Production Economics, 2010, 125(1):137-145. [11] ZHANG J L, LAM W H, CHEN B. On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows[J]. European Journal of Operational Research, 2016, 249(1):144-154. [12] SALAVATI-KHOSHGHALD M, GENDREAU M, JABALI O, et al. An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy[J]. European Journal of Operational Research, 2018, 273(1):175-189. [13] SALAVATI-KHOSHGHALD M, GENDREAU M, JABALI O, et al. A hybrid recourse policy for the vehicle routing problem with stochastic demands[J]. Euro Journal on Transportation&Logistics, 2019, 8(3):269-298. [14] ANDRES G, LAURENCE D, NACIMA L, et al. A multi-population algorithm to solve the vrp with stochastic service and travel times[J]. Computers&Industrial Engineering, 2018, 125:144-156. [15] SHI Y, BOUDOUH T, GRUNDER O. A robust optimization for a home health care routing and scheduling problem with consideration of uncertain travel and service times[J]. Transportation Research Part E Logistics and Transportation Review, 2019, 128:52-95. [16] CHEN L, GENDREAU M, HA M H, et al. A robust optimization approach for the road network daily maintenance routing problem with uncertain service time[J]. Transportation research Part E Logistics and transportation review, 2016, 85:40-51. [17]周鲜成,王莉,周开军,等.动态车辆路径问题的研究进展及发展趋势[J].控制与决策, 2019, 34(3):449-458. [18] ULMER M W, GOODSON J C, MATTFELD D C, et al.On modeling stochastic dynamic vehicle routing problems[J]. Euro Journal on Transportation and Logistics,2020, 9(2):100008. [19] GOODSON J C, THOMAS B W, OHLMANN J W. A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs[J]. European Journal of Operational Research, 2017, 258(1):216-229. [20] RITZINGER U, PUCHINGER J, HARTL R F. A survey on dynamic and stochastic vehicle routing problems[J].International Journal of Production Research, 2016, 54(1):215-231. [21]李凯文,张涛,王锐,等.基于深度强化学习的组合优化研究进展[J/OL].自动化学报:1-22[2020-12-09].https://kns. cnki. net/kcms/detail/11. 2109. tp. 20201207.1738. 001. html. [22]徐翔斌,李志鹏.强化学习在运筹学的应用:研究进展与展望[J].运筹与管理, 2020, 29(5):227-239. [23] ULMER M W, STRENG S. Same-Day delivery with pickup stations and autonomous vehicles[J]. Computers&Operations Research, 2019, 108:1-19. [24] GOEL R, MAINI R, BANSAL S. Vehicle routing problem with time windows having stochastic customers demands and stochastic service times:Modelling and solution[J].Journal of Computational Science, 2019, 3:1-10. [25]徐菱,胡小林,胡小亮.时间窗约束下需求可拆分的拣选与配送联合优化问题研究[J].交通运输工程与信息学报, 2020, 18(2):18-29. [26]张传琪,张杨.动态路网下多车型车辆路径问题研究[J].交通运输工程与信息学报, 2017, 15(2):112-118. [27]林清国.基于混合遗传算法的有时间窗车辆路径问题研究[D].济南:山东大学, 2007. [28] SHAW P. Using constraint programming and local search methods to solve vehicle routing problems[C]//In Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming.Berlin:Springer, 1998, 1520:417-431. [29] CHEN L, HA M H, LANGEVIN A, et al. Optimizing road network daily maintenance operations with stochastic service and travel times[J]. Transportation Research Part E Logistics and Transportation Review, 2014, 64:88-102. [30] EMEC U, CATAY B, BOZKAYA B. An adaptive large neighborhood search for an e-grocery delivery routing problem[J]. Computers&Operations Research, 2016, 69:109-125. [31] TURNER S, EISELE W, BENZ R. Travel time data collection handbook[R]. Texas:Texas Transportation Institute and Federal Highway Administration, 1998. [32] EHMKE J, CAMPBELL A, URBAN T. Ensuring service levels in routing problems with time windows and stochastic travel times[J]. European Journal of Operational Research, 2015, 240(2):539-550.