考虑外协服务的车辆路径优化问题

doi:10.12005/orms.2022.0039

运筹与管理 ›› 2022, Vol. 31 ›› Issue (2): 29-35.DOI: 10.12005/orms.2022.0039

考虑外协服务的车辆路径优化问题

葛显龙^1,2, 宋纯冰¹

1.重庆交通大学经济与管理学院,重庆 400074;
2.重庆交通大学智能物流网络重庆市重点实验室,重庆 400074

收稿日期:2020-04-25 出版日期:2022-02-25 发布日期:2022-03-11
作者简介:葛显龙,男,河南信阳人,教授,博导,研究领域为网络配送与路径优化;宋纯冰,男,硕士生,研究领域为城市物流配送。
基金资助:
国家社会科学基金资助项目(19CGL041)

Vehicle Routing Problem with Outsourced Services

GE Xian-long^1,2, SONG Chun-bing¹

1. School of Economics and Management, Chongqing Jiaotong University, Chongqing 400074, China;
2. Key Laboratory of Intelligent Logistics Network, Chongqing Jiaotong University, Chongqing 400074, China

Received:2020-04-25 Online:2022-02-25 Published:2022-03-11

摘要/Abstract

摘要： 降低零售企业的末端配送成本是控制物流成本的关键,共享经济的发展为此提供了新思路。因此,针对零售企业末端上门配送服务成本较高的情况,提出了考虑外协的车辆服务策略,将有意愿进行单次交付的线下客户作为协作车辆配合普通车辆来完成线上客户订单的配送,建立了以最小化普通车辆路径成本,普通车辆使用成本,时间窗惩罚成本和协作车辆补偿成本为目标函数的数学模型,并设计匹配算法和混合遗传算子的模拟退火算法对该模型进行求解,最后结合算例对提出的算法进行检验与分析。

关键词: 车辆路径问题, 外协服务, 软时间窗

Abstract: Reducing the end distribution cost of retail enterprises is the key to controlling logistics costs, and the development of the sharing economy provides new ideas for this. Therefore, in view of the high cost of door-to-door delivery services for retail companies, a vehicle service strategy that considers outsourcing is proposed, and offline customers who are willing to make a single delivery are used as cooperative vehicles to cooperate with ordinary vehicles to complete the delivery of online customer orders. A mathematical model is established to minimize common vehicle routing cost, common vehicle use cost, time window penalty cost and cooperative vehicle compensation cost as the objective function, and a matching algorithm and a hybrid genetic operator simulated annealing algorithm are designed to solve the model. Finally, an example is given to verify and analyze the proposed algorithm.

Key words: vehicle routing problem, outsourced services, soft time windows

中图分类号:

F252

葛显龙, 宋纯冰. 考虑外协服务的车辆路径优化问题[J]. 运筹与管理, 2022, 31(2): 29-35.

GE Xian-long, SONG Chun-bing. Vehicle Routing Problem with Outsourced Services[J]. Operations Research and Management Science, 2022, 31(2): 29-35.

参考文献

[1] 赵兴龙.基于K-means-遗传算法的众包配送网络优化研究[D].北京交通大学,2016
[2] 杨晓莉.配送型众包物流的人货供需匹配研究[D].大连海事大学,2017
[3] Martin S, Woensel T V. 50th anniversary invited article city logistics: challenges andopportunities[J]. Transportation Science, 2016, 50(2): 579-590.
[4] Agatz N, Erera A, Savelsbergh M, et al. Optimization for dynamic ride-sharing: a review[J]. European Journal of Operational Research, 2012, 223(2): 295-303.
[5] Furuhata M, Dessouky M,Ordóñez F, et al. Ridesharing: the state-of-the-art and future directions[J]. Transportation Research Part B: Methodological, 2013, 57: 28-46.
[6] Lee A, Savelsbergh M. Dynamic ridesharing: is there a role for dedicated drivers[J]. Transportation Research Part B: Methodological, 2015:81(2): 483-497.
[7] Stiglic M, Agatz N, Savelsbergh M, et al. The benefits of meeting points in ride-sharing systems[J]. Transportation Research Part B: Methodological, 2015, 82: 36-53.
[8] Baldacci R, Mingozzi M A. An exact method for the car pooling problem based on lagrangean column generation[J]. Operations Research, 2004, 52(3): 422-439.
[9] Masson R, Trentini A, Lehuédé, Fabien, et al. Optimization of a city logistics transportation system with mixed passengers and goods[J]. EURO Journal on Transportation and Logistics, 2017, 6(1): 81-109.
[10] Baoxiang Li, Dmitry Krushinsky, Tom Van Woensel, Hajo A. An adaptive large neighborhood search heuristic for the share-a-ride problem[J]. Computers & Operations Research, 2016, 66: 170-180.
[11] Ghilas V V, Demir E E,Woensel V T. Integrating passenger and freight transportation: model formulation and insights[J]. Progress in Hematology, 2013, 10(3): 1-41.
[12] Masson R, Trentini A, Lehuédé, Fabien, et al. Optimization of a city logistics transportation system with mixed passengers and goods[J]. EURO Journal on Transportation and Logistics, 2017, 6(1): 81-109.
[13] Fatnassi E, Chaouachi J, Klibi W. Planning and operating a shared goods and passengers on-demand rapid transit system for sustainable city-logistics[J]. Transportation Research Part B: Methodological, 2015, 81(2): 440-460.
[14] Archetti C, Savelsbergh M, Speranza M G. The vehicle routing problem with occasional drivers[J]. European Journal of Operational Research, 2016,254(2): 472-480.
[15] Alp A, Niels A, Kroon L G, et al. Crowdsourced delivery——a pickup and delivery problem with Ad-hoc drivers[J]. SSRN Electronic Journal, 2016, 43{Fatnassi, 2015 #88}(3): 57-69.
[16] 葛显龙,辜羽洁,谭柏川.基于第三方带软时间窗约束的车辆路径问题研究[J].计算机应用研究,2015,32(3):689-693.
[17] 葛显龙,竹自强.带软时间窗的电动车辆路径优化问题[J].工业工程与管理, 2019,24(4):96-104.

考虑外协服务的车辆路径优化问题

Vehicle Routing Problem with Outsourced Services

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

[1]	胡卉, 刘富鑫, 王愚勤, 冯芷郁, 王瑞. 基于改进模拟退火算法的推动式生产-配送协调优化[J]. 运筹与管理, 2022, 31(2): 15-22.
[2]	苏欣欣, 王红卫, 秦虎, 王恺. 混合启发式算法求解多配送人员车辆路径问题[J]. 运筹与管理, 2022, 31(2): 42-47.
[3]	范厚明, 徐振林, 李阳, 杨翔. 开放式多中心需求可拆分VRP及混沌遗传模拟退火算法[J]. 运筹与管理, 2022, 31(1): 92-98.
[4]	王愚勤, 胡卉, 刘富鑫, 王艳慧, 赵姣, 韩毅. 智能网联下无人车配送路径优化[J]. 运筹与管理, 2021, 30(8): 52-58.
[5]	向婷, 李妍峰. 基于成本和加班时长的双目标家庭护理人员调度问题[J]. 运筹与管理, 2021, 30(8): 233-239.
[6]	张晓楠, 范厚明. 求解带时间窗车辆路径问题的混合Memetic算法[J]. 运筹与管理, 2021, 30(7): 128-135.
[7]	王新, 王征, 徐伟. 面向多个无人机站点的车辆与无人机联合配送路径问题研究[J]. 运筹与管理, 2021, 30(5): 31-37.
[8]	薛桂琴, 王征. 带客户协同分仓的动态车辆路径问题研究[J]. 运筹与管理, 2021, 30(11): 19-25.
[9]	刘长石, 王松, 罗亮, 邓胜前. 时变路网条件下联合配送的开放式车辆路径问题[J]. 运筹与管理, 2021, 30(11): 26-33.
[10]	陈萍, 董文哲, 于信尧. 新能源移动充电车路径优化问题研究[J]. 运筹与管理, 2020, 29(2): 12-18.
[11]	潘立军, 符卓, 刘喜梅. 共享单车再平衡问题及其容差插入启发式算法[J]. 运筹与管理, 2019, 28(10): 26-32.
[12]	徐国勋, 李妍峰, 李军, 徐冠宇. 多类型公共自行车调运问题[J]. 运筹与管理, 2019, 28(1): 116-124.
[13]	徐国勋, 李妍峰, 李军. 现金押运路线问题——基于多类型的风险[J]. 运筹与管理, 2018, 27(4): 72-82.
[14]	饶卫振,李美燕,寻楠,王炳成,于灏,侯艳辉. 物流配送装载率分析与四阶段算法研究[J]. 运筹与管理, 2018, 27(12): 64-72.
[15]	李杰, 赵旭东, 王玉霞, CHU Chao-hsien. 面向电商终端物流配送的电动车配置与路径集成优化[J]. 运筹与管理, 2018, 27(10): 23-30.