目的 针对多种类型的回收商品在周期性回收和车辆资源共享相结合方面存在的周期性车辆配置不均衡和车辆共享效率不高等问题,研究结合车辆共享和多车舱周期性装载的回收物流运输车辆路径问题。方法 首先,结合多种类型回收商品和周期性回收需求,以最小化回收物流总运营成本和多舱车的使用数目为目标,建立数学优化模型。其次,设计改进的多目标模拟退火算法对该模型进行求解,并引入基于相似性解的选择机制和车辆资源共享策略来提高帕累托优化解的优化质量,增强算法的收敛性能。然后,通过与其他3种多目标元启发式算法进行对比,验证提出算法在求解效率和结果质量方面的有效性。最后,结合重庆市某回收中心的实际案例,比较分析优化前后回收物流总运营成本和多舱车的使用数目等优化指标,并分析探讨不同周期划分对回收物流运输网络优化结果的影响。结果 优化后的逆向物流总运营成本降低了55.5%,回收车辆减少了9辆,并验证了合理划分回收中心的周期有助于降低回收成本和提升资源利用率。结论 所设计的模型和算法有助于降低回收物流的总运营成本和减少多舱车的使用数目,为基于资源共享的多车舱周期性回收物流运输车辆路径问题研究提供了新的理论指导和方法支撑。
Abstract
The work aims to investigate the vehicle routing problem of multi-compartment periodic recycling logistics transportation based on resource sharing, so as to deal with the deficiencies in the combination of periodic recycling and vehicle resource sharing for various types of recycled goods, such as the imbalance of periodic vehicle allocation and the low efficiency of vehicle sharing. Firstly, a mathematical optimization model with two objectives for minimizing the total operating cost and the number of multi-compartment vehicles used in reverse logistics was established by combining multiple types of recycled goods and periodic recycling demands. Secondly, an improved multi-objective simulated annealing algorithm was formulated to address the mathematical model, and a selection mechanism based on similarity solutions and a vehicle resource sharing strategy were introduced to enhance the solution quality of the Pareto optimal solution and improve the convergence efficiency of the algorithm. Subsequently, through comparison experiments with three other multi-objective heuristic algorithms, the effectiveness of the proposed method in terms of efficiency and quality of solutions was fully demonstrated. Finally, the total operating cost of recycling logistics and the number of multi-compartment vehicles involved before and after the optimization were compared within a practical case of a recycling center in Chongqing, China. The effect of different period divisions on the optimization results of the recycling logistics transportation network was also analyzed and discussed. The total operating cost of recycling logistics after optimization was reduced by 55.5%, the number of recycling vehicles was reduced by 9, demonstrating that the reasonable division of the periods contributed to reduce the recycling cost and improve the resource utilization rate. In conclusion, the proposed method can minimize the total operation cost and the number of multi-compartment vehicles of reverse logistics, thus provide new theoretical guidance and methodological support for the multi-compartment vehicle periodic recycling logistics transportation vehicle routing problem based on resource sharing.
关键词
多车舱装载 /
周期性回收 /
资源共享 /
车辆路径问题 /
改进的多目标模拟退火算法
Key words
multi-compartment loading /
periodic recycling /
resource sharing /
vehicle routing problem /
improved multi-objective simulated annealing algorithm
{{custom_sec.title}}
{{custom_sec.title}}
{{custom_sec.content}}
参考文献
[1] GOVINDAN K, GHOLIZADEH H.Robust Network Design for Sustainable-Resilient Reverse Logistics Network Using Big Data: a Case Study of End-of-Life Vehicles[J]. Transportation Research Part E: Logistics and Transportation Review, 2021, 149: 102279.
[2] REDDY K N, KUMAR A, CHOUDHARY A, et al.Multi-Period Green Reverse Logistics Network Design: An Improved Benders-Decomposition-Based Heuristic Approach[J]. European Journal of Operational Research, 2022, 303(2): 735-752.
[3] 张琦琪, 陈群. 改进分散搜索算法求解包装废弃物回收路径规划问题[J]. 包装工程, 2024, 45(9): 193-200.
ZHANG Q Q, CHEN Q.Improved Scatter Search Algorithm to Solve Packaging Waste Recovery Vehicle Routing Problem[J]. Packaging Engineering, 2024, 45(9): 193-200.
[4] HONG Y X, YAN W Y, GE Q.Designing Sustainable Logistics Networks for Classified Municipal Solid Wastes Collection and Transferring with Multi-Compartment Vehicles[J]. Sustainable Cities and Society, 2023, 99: 104921.
[5] 王勇, 谢红霞, 苟梦圆, 等. 基于车辆共享的生鲜商品多车舱装载配送路径优化问题[J]. 包装工程, 2025, 46(3): 210-220.
WANG Y, XIE H X, GOU M Y, et al.Fresh Commodity Multi-Compartment Loading Distribution Routing Optimization Problem Based on Vehicle Sharing[J]. Packaging Engineering, 2025, 46(3): 210-220.
[6] MASMOUDI M, BALDACCI R, MANCINI S, et al.Multi-Compartment Waste Collection Vehicle Routing Problem with Bin Washer[J]. Transportation Research Part E: Logistics and Transportation Review, 2024, 189: 103681.
[7] PÓVOA C L R, ROBOREDO M C, VELASCO A S, et al. A Hybrid GRASP and Tabu-Search Heuristic and an Exact Method for a Variant of the Multi-Compartment Vehicle Routing Problem[J]. Expert Systems with Applications, 2025, 259: 125319.
[8] WANG Y, GOU M Y, LUO S Y, et al.The Multi-Depot Pickup and Delivery Vehicle Routing Problem with Time Windows and Dynamic Demands[J]. Engineering Applications of Artificial Intelligence, 2025, 139: 109700.
[9] BENEICH C, DOUIRI S M.Solving the Multi Compartment Vehicle Routing Problem Using a Hybridized Simulated Annealing Algorithm[J]. International Journal of Applied and Computational Mathematics, 2023, 9(6): 127.
[10] CHEN J M, DAN B, SHI J.A Variable Neighborhood Search Approach for the Multi-Compartment Vehicle Routing Problem with Time Windows Considering Carbon Emission[J]. Journal of Cleaner Production, 2020, 277: 123932.
[11] 尚春剑, 马良, 刘勇. 垃圾分类下带时间窗异构周期性混合车辆路径问题模型及算法[J]. 系统工程, 2021, 39(6): 131-145.
SHANG C J, MA L, LIU Y.The Model and Algorithm of Heterogeneous Periodic Hybrid Vehicle Routing Problem with Time Window under Garbage Classification[J]. Systems Engineering, 2021, 39(6): 131-145.
[12] 肖建华, 张文雪, 潘钰雅, 等.基于分类垃圾收运时效性的多周期多车舱路径优化研究[J/OL]. 中国管理科学, 2023: 1-15.(2023-07-13) [2025-02-07]. https://doi.org/10.16381/j.cnki.issn1003-207x.2023.0050.
XIAO J H, ZHANG W X, PAN Y Y, et al.A Multi-Period Multi-Compartment Vehicle Routing Problem for Sorted-Waste Collection with Timeliness[J/OL]. Chinese Journal of Management Science, 2023: 1-15.(2023-07-13)[2025-02-07]. https://doi.org/10.16381/j.cnki.issn1003-207x.2023.0050.
[13] WANG Y, LUO S Y, FAN J X, et al.The Multidepot Vehicle Routing Problem with Intelligent Recycling Prices and Transportation Resource Sharing[J]. Transportation Research Part E: Logistics and Transportation Review, 2024, 185: 103503.
[14] MOHAMMADI M, RAHMANIFAR G, HAJIAGHAEI- KESHTELI M, et al.A Dynamic Approach for the Multi-Compartment Vehicle Routing Problem in Waste Management[J]. Renewable and Sustainable Energy Reviews, 2023, 184: 113526.
[15] CHEN T T, CHU F, ZHANG J T, et al.Sustainable Collaborative Strategy in Pharmaceutical Refrigerated Logistics Routing Problem[J]. International Journal of Production Research, 2024, 62(14): 5036-5060.
[16] 李阳, 范厚明, 张晓楠. 动态需求下车辆路径问题的周期性优化模型及求解[J]. 中国管理科学, 2022, 30(8): 254-266.
LI Y, FAN H M, ZHANG X N.A Periodic Optimization Model and Solution for Capacitated Vehicle Routing Problem with Dynamic Requests[J]. Chinese Journal of Management Science, 2022, 30(8): 254-266.
[17] MOJTAHEDI M, FATHOLLAHI-FARD A M, TAVAKKOLI- MOGHADDAM R, et al. Sustainable Vehicle Routing Problem for Coordinated Solid Waste Management[J]. Journal of Industrial Information Integration, 2021, 23: 100220.
[18] PALOMINO-PEREZ Y, ROJAS M, AMAYA-MIER R.Design of a Reverse Logistics Network for Medical Waste Considering Location and Routing Decisions[J]. Journal of Cleaner Production, 2024, 474: 143592.
[19] SOLOMON M M.Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints[J]. Operations Research, 1987, 35(2): 254-265.
[20] ZHOU H, LI Y, MA C Y, et al.Modular Vehicle Routing Problem: Applications in Logistics[J]. Transportation Research Part E: Logistics and Transportation Review, 2025, 197: 104022.
[21] XU S, OU X Y, GOVINDAN K, et al.An Adaptive Genetic Hyper-Heuristic Algorithm for a Two-Echelon Vehicle Routing Problem with Dual-Customer Satisfaction in Community Group-Buying[J]. Transportation Research Part E: Logistics and Transportation Review, 2025, 194: 103874.
[22] COMERT S E, YAZGAN H R.A New Approach Based on Hybrid Ant Colony Optimization-Artificial Bee Colony Algorithm for Multi-Objective Electric Vehicle Routing Problems[J]. Engineering Applications of Artificial Intelligence, 2023, 123: 106375.
基金
国家自然科学基金（72371044,71961027）; 重庆市教委科学技术研究重大项目（KJZD-M202300704）; 巴渝学者青年项目（YS2021058）; 重庆交通大学“揭榜挂帅”项目（Z36250002）; 重庆市研究生科研创新项目（CYS240484）; 重庆市研究生科研创新项目（CYS25567）
PDF(2758 KB)
渝公网安备 50010702501716号 渝ICP备15012534号-2
