摘要
基于大连市某外卖配送站点的运营实例,针对午餐高峰时段涌入的大量订单,对骑手的配送路径进行优化.以最大化运输效率为目标,综合考虑外卖配送的实际约束,有针对性地构建骑手配送路径优化的混合整数规划模型,开发改进型蚁群算法对实例进行求解.然后,将所得结果与行业实际数据、小规模算例的CPLEX精确解以及传统的蚁群算法进行对比,从多方面验证了算法的合理性与有效性.最后,详细分析了算法参数对优化结果的影响机理,可为外卖配送行业提供决策支持.
Based on the operation example of a takeaway distribution station in Dalian,the distribution route of riders was optimized for the influx of orders during the lunch rush hour.Aiming at maximizing transportation efficiency and by considering the actual constraints of takeout distribution,a mixed integer programming model for rider distribution route optimization was constructed,and an improved ant colony algorithm was developed to solve the case.Then the results were compared with the actual industry data,the CPLEX exact solution of the small-scale example and the traditional ant colony algorithm,the rationality and effectiveness of the algorithm were verified from many aspects.Finally,the influence mechanism of the algorithm parameters on the optimization results was analyzed in detail,which can provide decision support for takeout distribution industry.
作者
靳志宏
鞠新诚
郭加佳
杨珍花
JIN Zhi-hong;JU Xin-cheng;GUO Jia-jia;YANG Zhen-hua(Transportation Engineering College,Dalian Maritime University,Dalian 116026,China;College of Economics and Management,Shandong University of Science and Technology,Qingdao 266590,China)
出处
《大连海事大学学报》
CAS
CSCD
北大核心
2019年第4期55-64,共10页
Journal of Dalian Maritime University
基金
国家自然科学基金面上项目(71572023
71702019)
欧盟H2020项目(MSCA-RISE 777742-56)
大连市领军人才项目(2018-573)
中央高校基本科研业务费专项资金资助项目(3132019301
3132019031)
关键词
O2O
外卖
配送路径优化
取送货
蚁群算法
online to offline(O2O)
takeaway
distribution routing optimization
pickup and delivery
ant colony algorithm
