Multi-Compartment Vehicle Routing Problem Considering Traffic Congestion under the Mixed Carbon Policy

被引:4
|
作者
Fan, Xueru [1 ]
Yao, Guanxin [2 ]
Yang, Yang [3 ]
机构
[1] Jiangsu Univ, Sch Management, Zhenjiang 212013, Peoples R China
[2] Yangzhou Univ, Jiangsu Modern Logist Res Base, Yangzhou 225009, Peoples R China
[3] Jiangsu Univ, China Inst Agr Equipment Ind Dev, Zhenjiang 212013, Peoples R China
来源
APPLIED SCIENCES-BASEL | 2023年 / 13卷 / 18期
基金
中国国家自然科学基金;
关键词
mixed carbon policy; traffic congestion; multi-compartment vehicle routing problem (MCVRP); two-stage variable neighborhood threshold acceptance algorithm (VNS-TA); sustainable transportation; ALGORITHM;
D O I
10.3390/app131810304
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
The use of multi-compartment vehicles (MCVs) in urban logistics distribution is increasing. However, urban traffic congestion causes high carbon emissions in the logistics distribution, resulting in unsustainable development in urban transportation. In addition, the application of the mixed carbon policy has gradually become the first choice for energy conservation and emission reduction in some countries and regions. The transportation industry is a major carbon-emitting industry, which needs to be constrained by carbon emission reduction policies. In this context, the research on the multi-compartment vehicle routing problem (MCVRP) considering traffic congestion under the mixed carbon policy is carried out. Firstly, a mathematical model of MCVRP considering traffic congestion under the mixed carbon policy is constructed. Secondly, a two-stage variable neighborhood threshold acceptance algorithm (VNS-TA) is proposed to solve the above mathematical model. Thirdly, 14 adapted standard examples of the MCVRP are used to verify the effectiveness and optimization ability of the two-stage VNS-TA algorithm. A simulation example of the MCVRP considering traffic congestion under the mixed carbon policy is used to conduct sensitivity analyses for different scenarios. Finally, the following conclusions are drawn: (1) the two-stage VNS-TA algorithm is effective and has strong optimization ability in solving the basic MCVRP, and (2) the two-stage VNS-TA algorithm can solve and optimize the MCVRP considering traffic congestion under the mixed carbon policy, which has the effects of cost saving and energy conservation and emission reduction.
引用
收藏
页数:27
相关论文
共 50 条
  • [21] Two metaheuristic approaches for solving the multi-compartment vehicle routing problem
    Hiba Yahyaoui
    Islem Kaabachi
    Saoussen Krichen
    Abdulkader Dekdouk
    Operational Research, 2020, 20 : 2085 - 2108
  • [22] Improved particle swarm optimization for multi-compartment vehicle routing problem
    Chen J.
    Zhang S.
    Dan B.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2019, 25 (11): : 2952 - 2962
  • [23] Two metaheuristic approaches for solving the multi-compartment vehicle routing problem
    Yahyaoui, Hiba
    Kaabachi, Islem
    Krichen, Saoussen
    Dekdouk, Abdulkader
    OPERATIONAL RESEARCH, 2020, 20 (04) : 2085 - 2108
  • [24] A dynamic approach for the multi-compartment vehicle routing problem in waste management
    Mohammadi, Mostafa
    Rahmanifar, Golman
    Hajiaghaei-Keshteli, Mostafa
    Fusco, Gaetano
    Colombaroni, Chiara
    Sherafat, Ali
    RENEWABLE & SUSTAINABLE ENERGY REVIEWS, 2023, 184
  • [25] A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
    El Fallahi, Abdellah
    Prins, Christian
    Calvo, Roberto Wolfler
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (05) : 1725 - 1741
  • [26] Solving the vehicle routing problem with multi-compartment vehicles for city logistics
    Eshtehadi, Reza
    Demir, Emrah
    Huang, Yuan
    COMPUTERS & OPERATIONS RESEARCH, 2020, 115 (115)
  • [27] A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
    Henke, Tino
    Speranza, M. Grazia
    Waescher, Gerhard
    ANNALS OF OPERATIONS RESEARCH, 2019, 275 (02) : 321 - 338
  • [28] Consistent vehicle routing problem considering traffic congestion and workload balance
    Liu H.
    Ru Y.
    Ru, Yihong (yhru@bjtu.edu.cn), 1600, Science Press (51): : 931 - 937
  • [29] Solving the multi-compartment vehicle routing problem by an augmented Lagrangian relaxation method
    Song, Maocan
    Cheng, Lin
    Lu, Bin
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 237
  • [30] Measuring and evaluating hybrid metaheuristics for solving the multi-compartment vehicle routing problem
    Kaabachi, Islem
    Yahyaoui, Hiba
    Krichen, Saoussen
    Dekdouk, Abdelkader
    MEASUREMENT, 2019, 141 : 407 - 419