考虑空载损失的非集中式共同配送订单分派及路径优化研究

doi:10.3969/j.issn.1007-7375.230228

工业工程 ›› 2024, Vol. 27 ›› Issue (2): 107-118,137.doi: 10.3969/j.issn.1007-7375.230228

• 工业互联与制造服务管理 • 上一篇下一篇

考虑空载损失的非集中式共同配送订单分派及路径优化研究

张萌¹, 孙璐璐¹, 苏兵¹, 王能民^2,3

1. 西安工业大学经济管理学院，陕西西安 710021;
2. 西安交通大学管理学院，陕西西安 710049;
3. 陕西省制造服务业过程挖掘工程研究中心，陕西西安 710049

收稿日期:2023-12-03 出版日期:2024-04-30 发布日期:2024-04-29
通讯作者: 王能民(1974-),男,湖南省人,教授,博士,主要研究方向为可持续运营与管理。Email:wangnm@mail.xjtu.edu.cn E-mail:wangnm@mail.xjtu.edu.cn
作者简介:张萌(1989-),男,江苏省人,副教授,博士,主要研究方向为物流与供应链管理
基金资助:
国家自然科学基金重大资助项目 (72192830, 72192834)；国家自然科学基金资助项目 (72301205, 72301223)；教育部人文社科基金资助项目 (21YJC630165)；陕西省哲学社会科学研究专项 (2024QN181)；陕西省教育厅专项 (23JK0129)

Order Dispatching and Routing for Decentralized Joint Distribution Considering Empty-loading Losses

ZHANG Meng¹, SUN Lulu¹, SU Bing¹, WANG Nengmin^2,3

1. School of Economics and Management, Xi’an Technological University, Xi’an 710021, China;
2. School of Management, Xi’an Jiaotong University, Xi’an 710049, China;
3. ERC for Process Mining of Manufacturing Services in Shaanxi Province, Xi’an 710049, China

Received:2023-12-03 Online:2024-04-30 Published:2024-04-29

摘要/Abstract

摘要： 物流活动的空载率居高不下源于路径规划不合理及企业间缺少合作，共同配送是降低空载损失的有效模式，但非集中式共同配送下物流企业可能基于被分派的订单选择自身成本最小的配送路径，从而导致共同配送联盟的空载损失变大。本文研究考虑空载损失的非集中式共同配送订单分派及路径优化，首先提出空载损失定义，权衡整个配送过程的成本最小和空载损失最小两个目标，基于非集中式共同配送的特征设计订单分派策略，进而建立订单分派及路径优化模型。设计了基于ε约束法的精确算法、改进的MOPSO (multiple objective particle swarm optimization) 算法、多项式时间快速算法进行求解，并结合算例验证算法的有效性。数值分析结果表明，即使物流企业均追求自身成本最小化，提出的订单分派策略也可得到与全局优化相近的结果。

关键词: 非集中式共同配送, 空载损失, 订单分派, 车辆路径, 多目标优化

Abstract: The high empty-loading rate in logistics activities may result from unreasonable routing and insufficient cooperation among enterprises. Joint distribution is an effective mode to reduce empty-loading losses. However, under the condition of decentralized joint distribution, logistics enterprises may choose the routes with minimum cost based on the assigned orders, resulting in an increase in empty-loading losses of the joint distribution alliance. This study investigates order dispatching and routing for decentralized joint distribution considering empty-loading losses. A definition of empty-loading losses is given firstly. Then, with the trade-off between the objectives of minimizing cost and empty-loading losses in the entire distribution process, an order dispatching strategy is proposed based on the characteristics of decentralized joint distribution mode, and the order dispatching and routing optimization models are developed. A precise algorithm based on epsilon constraint method, an improved MOPSO (Multiple Objective Particle Swarm Optimization) algorithm, and a polynomial-time fast algorithm are developed to solve the problem. The effectiveness of the proposed algorithms is verified based on numerical instances. Analysis results indicate that even if logistics companies pursue cost minimization, the proposed order dispatching strategy can achieve results similar to global optimization.

Key words: decentralized joint distribution, empty-loading losses, order dispatching, vehicle routing, multi-objective optimization

中图分类号:

F407.47
U116

张萌, 孙璐璐, 苏兵, 王能民. 考虑空载损失的非集中式共同配送订单分派及路径优化研究[J]. 工业工程, 2024, 27(2): 107-118,137.

ZHANG Meng, SUN Lulu, SU Bing, WANG Nengmin. Order Dispatching and Routing for Decentralized Joint Distribution Considering Empty-loading Losses[J]. Industrial Engineering Journal, 2024, 27(2): 107-118,137.

参考文献

[1] WANG N, JIANG Q, JIANG B, et al. Enterprises’ green growth model and value chain reconstruction[M]. Singapore: Springer, 2022.
[2] SHI W, WANG N, ZHANG M, et al. A bi-objective pollution routing optimisation problem with decentralised cooperation and split delivery[J]. IEEE Transactions on Intelligent Transportation Systems, 2023, 24(11): 12357-12371
[3] DANTZIG G, RAMSER J. The truck dispatching problem[J]. Management Science, 1959, 6: 80-91
[4] WANG K, SHAO Y, ZHOU W. Matheuristic for a two-echelon capacitated vehicle routing problem with environmental considerations in city logistics service[J]. Transportation Research Part D: Transport and Environment, 2017, 57: 262-276
[5] DUHAMEL C, LACOMME P, QUILLIOT A, et al. A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem[J]. Computers & Operations Research, 2011, 38(3): 617-640
[6] PUREZA V, MORABITO R, REIMANN M. Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW[J]. European Journal of Operational Research, 2012, 218(3): 636-647
[7] NASRI, M, HAFIDI I, METRANE A. Multithreading parallel robust approach for the VRPTW with uncertain service and travel times[J]. Symmetry, 2020, 13(1): 36
[8] ZHANG J, LAM W, CHEN Y. 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
[9] WANG Y, ZHANG J, ASSOGBA K, et al. Collaboration and transportation resource sharing in multiple centers vehicle routing optimization with delivery and pickup[J]. Knowledge-Based Systems, 2018, 160: 296-310
[10] ALINAGHIAN M, SHOKOUHI N. Multi-depot multi-compartment vehicle routing problem, solved by a hybrid adaptive large neighborhood search[J]. Omega, 2018, 76: 85-99
[11] LIU R, JIANG Z. Task selection and routing problems in collaborative truckload transportation[J]. Transportation Research Part E: Logistics and Transportation Review, 2010, 46(6): 1071-1085
[12] WANG Y, ZHANG S, ASSOGBA K, et al. Economic and environmental evaluations in the two-echelon collaborative multiple centers vehicle routing optimization[J]. Journal of Cleaner Production, 2018, 197: 443-461
[13] FERNÁNDEZ E, ROCA-RIU M, SPERANZA M G. The shared customer collaboration vehicle routing problem[J]. European Journal of Operational Research, 2018, 265(3): 1078-1093
[14] LI J, LI Y, PARDALOS P M. Multi-depot vehicle routing problem with time windows under shared depot resources[J]. Journal of Combinatorial Optimization, 2016, 31(2): 515-532
[15] 刘家利, 马祖军. 存在车辆租赁及共享且有时间窗的多配送中心开环VRP[J]. 系统工程理论与实践, 2013, 33(3): 666-675
LIU Jiali, MA Zujun. Multi-depot open vehicle routing problem with time windows based on vehicle leasing and sharing[J]. Systems Engineering—Theory & Practice, 2013, 33(3): 666-675
[16] 饶卫振, 段忠菲, 王炳成, 等. 协作车辆路径问题距离和能耗节约量理论边界研究[J]. 系统管理学报, 2019, 28(4): 697-707
RAO Weizhen, DUAN Zhongfei, WANG Bingcheng, et al. Theoretical bound of savings on distance and fuel consumption in the collaborative vehicle routing problem[J]. Journal of Systems & Management, 2019, 28(4): 697-707
[17] BOMPADRE A, DROR M, ORLIN J B. Improved bounds for vehicle routing solutions[J]. Discrete Optimization, 2006, 3(4): 299-316
[18] WANG N, CUI W, ZHANG M, et al. Routing optimization for medical waste collection considering infectious risk and multiple disposal centers[J]. Expert Systems With Applications, 2023, 234: 121035
[19] 张萌, 王能民. 重大事故规避的危险品运输车辆路径优化研究[J]. 运筹与管理, 2018, 27(8): 1-9
ZHANG Meng, WANG Nengmin. Research on vehicle routing for hazardous materials transportation based on catastrophe avoidance[J]. Operations Research and Management Science, 2018, 27(8): 1-9
[20] ZHANG M, WANG N, HE Z, et al. Vehicle routing optimization for hazmat shipments considering catastrophe avoidance and failed edges[J]. Transportation Research Part E: Logistics and Transportation Review, 2021, 150: 102337
[21] ZHANG M, WANG N, HE Z, et al. Bi-objective vehicle routing for hazardous materials transportation with actual load dependent risks and considering the risk of each vehicle[J]. IEEE Transactions on Engineering Management, 2019, 66(3): 429-442
[22] 王振, 郭健全. 模糊环境下考虑供应中断的再制造闭环供应链研究[J]. 工业工程, 2021, 24(1): 140-146
WANG Zhen, GUO Jianquan. Research on remanufacturing closed-loop supply chain considering supply disruption in uncertain environment[J]. Industrial Engineering Journal, 2021, 24(1): 140-146
[23] 胡小建, 袁丁. 基于鱼骨型仓库布局的多车拣选路径问题优化[J]. 工业工程, 2022, 25(1): 45-53
HU Xiaojian, YUAN Ding. An optimization of multi-vehicle picking routing problem based on fishbone warehouse layout[J]. Industrial Engineering Journal, 2022, 25(1): 45-53
[24] 徐韬, 祝烨, 谢晓忠, 等. 基于全过程的偶发性拥堵消散时间预测模型[J]. 工业工程, 2022, 25(3): 157-163
XU Tao, ZHU Ye, XIE Xiaozhong, et al. A prediction model of occasional congestion dissipation time based on the whole process[J]. Industrial Engineering Journal, 2022, 25(3): 157-163
[25] HOOGEVEEN J. Analysis of Christofides’ heuristic: Some paths are more difficult than cycles[J]. Operations Research Letters, 1991, 10(5): 291-295

考虑空载损失的非集中式共同配送订单分派及路径优化研究

Order Dispatching and Routing for Decentralized Joint Distribution Considering Empty-loading Losses

RichHTML

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价

[1]	吴廷映, 鲁佳琪, 夏洋. 多车程多时间窗车辆路径问题研究[J]. 工业工程, 2024, 27(2): 147-157.
[2]	周国华, 马依婷. 基于改进NSGA-II的铁路项目进度计划多目标优化[J]. 工业工程, 2023, 26(4): 85-95.
[3]	王书娟, 侯艳, 滕少华, 朱清华. 基于改进SPEA2的原油短期调度问题研究[J]. 工业工程, 2023, 26(3): 124-133.
[4]	汪和平, 龚星霖, 李艳. 基于改进NSGA-II算法的装配式建筑施工调度优化[J]. 工业工程, 2023, 26(2): 85-92.
[5]	张树柱, 邱兵兵, 山家骏, 隆清琦. 考虑驾驶员疲劳的车辆路径优化及算法研究[J]. 工业工程, 2023, 26(2): 132-140,184.
[6]	熊浩, 郭昊颖, 鄢慧丽, 陈锦怡. 外卖配送路径多目标实时优化研究[J]. 工业工程, 2023, 26(1): 98-107.
[7]	廖毅, 叶艳, 冷杰武. 车载可补货无人配送小车配送路径研究[J]. 工业工程, 2023, 26(1): 108-114.
[8]	董海, 雷凤达. 基于萤火虫算法的动态车辆路径规划[J]. 工业工程, 2022, 25(6): 110-119,125.
[9]	钱伟康, 唐红涛. 考虑恶化效应的多目标非置换流水车间调度研究[J]. 工业工程, 2022, 25(2): 128-136.
[10]	李妍峰, 李佳, 向婷. 需求可拆分的无人机与卡车协同路径优化问题[J]. 工业工程, 2022, 25(1): 54-63,143.
[11]	陈红梅, 张远航, 张春玲. 动态视角下城市通勤路径优化研究[J]. 工业工程, 2022, 25(1): 64-74.
[12]	曾强, 吴锦锦, 王培露, 李明金. 混合工作日历下批量生产柔性作业车间多目标调度方法[J]. 工业工程, 2021, 24(6): 8-17.
[13]	杨坤, 伏跃红, 江志斌. 基于分布式光伏发电的多目标分时电价优化策略[J]. 工业工程, 2021, 24(6): 108-115.
[14]	闫军, 常乐, 王璐璐, 赵彤. 带时间窗的同时取送货车辆路径问题求解算法[J]. 工业工程, 2021, 24(5): 72-76.
[15]	刘雪红, 张涛, 彭兆, 王磊. 面向医疗器械企业灭菌工艺的不同容量平行机批调度[J]. 工业工程, 2021, 24(1): 82-89.