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 条
  • [41] Hybrid Algorithm for Solving the Multi-compartment Vehicle Routing Problem with Time Windows and Profit
    Kaabi, Hadhami
    Jabeur, Khaled
    ICIMCO 2015 PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS, VOL. 1, 2015, : 324 - 329
  • [42] Hybrid Metaheuristic to Solve the Selective Multi-compartment Vehicle Routing Problem with Time Windows
    Kaabi, Hadhami
    PROCEEDINGS OF THE SECOND INTERNATIONAL AFRO-EUROPEAN CONFERENCE FOR INDUSTRIAL ADVANCEMENT (AECIA 2015), 2016, 427 : 185 - 194
  • [43] An Exact Approach to the Multi-Compartment Vehicle Routing Problem: The Case of a Fuel Distribution Company
    Baptista, Guilherme
    Vieira, Miguel
    Pinto, Telmo
    MATHEMATICS, 2024, 12 (04)
  • [44] Product-oriented time window assignment for a multi-compartment vehicle routing problem
    Martins, Sara
    Ostermeier, Manuel
    Amorim, Pedro
    Huebner, Alexander
    Almada-Lobo, Bernardo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 276 (03) : 893 - 909
  • [45] The fuel replenishment problem: A split-delivery multi-compartment vehicle routing problem with multiple trips
    Wang, L.
    Kinable, J.
    van Woensel, T.
    COMPUTERS & OPERATIONS RESEARCH, 2020, 118
  • [46] A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning
    Chamurally, Shabanaz
    Rieck, Julia
    NETWORKS, 2024, 84 (03) : 300 - 325
  • [47] Heuristic algorithms for solving the multi-compartment vehicle routing problem with time windows and heterogeneous fleet
    Topaloglu, Duygu
    Polat, Olcay
    Kalayci, Can Berk
    PAMUKKALE UNIVERSITY JOURNAL OF ENGINEERING SCIENCES-PAMUKKALE UNIVERSITESI MUHENDISLIK BILIMLERI DERGISI, 2023, 29 (08): : 870 - 884
  • [48] Evolutionary Local Search Algorithm to Solve the Multi-Compartment Vehicle Routing Problem with Time Windows
    Melechovsky, Jan
    PROCEEDINGS OF 30TH INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS, PTS I AND II, 2012, : 564 - 568
  • [49] Multi-Compartment Vehicle Routing Problem to Find the Alternative Distribution Route of Petroleum Product Delivery
    Febriandini, I. F.
    Yuniaristanto
    Sutopo, W.
    2ND INTERNATIONAL CONFERENCE ON MATERIALS TECHNOLOGY AND ENERGY, 2020, 943
  • [50] A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands
    Goodson, Justin C.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 241 (02) : 361 - 369