Emergency logistics network optimization with time window assignment

被引:24
|
作者
Wang, Yong [1 ]
Wang, Xiuwen [2 ]
Fan, Jianxin [3 ]
Wang, Zheng [4 ]
Zhen, Lu [2 ]
机构
[1] Chongqing Jiaotong Univ, Sch Econ & Management, Chongqing 400074, Peoples R China
[2] Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China
[3] Chongqing Jiaotong Univ, Sch River & Ocean Engn, Chongqing 400074, Peoples R China
[4] Dalian Maritime Univ, Sch Maritime Econ & Management, Dalian 116026, Peoples R China
基金
中国国家自然科学基金;
关键词
Emergency logistics; Two-echelon vehicle routing problem; Vehicle sharing; Time window assignment; Multi-objective adaptive large neighborhood search; VEHICLE-ROUTING PROBLEM; LARGE NEIGHBORHOOD SEARCH; MULTIOBJECTIVE GENETIC ALGORITHM; DELIVERY PROBLEM; MEMETIC ALGORITHM; PICKUP; MODEL; METAHEURISTICS;
D O I
10.1016/j.eswa.2022.119145
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
During natural disasters or accidents, an emergency logistics network aims to ensure the distribution of relief supplies to victims in time and efficiently. When the coronavirus disease 2019 (COVID-19) emerged, the gov-ernment closed the outbreak areas to control the risk of transmission. The closed areas were divided into high -risk and middle-/low-risk areas, and travel restrictions were enforced in the different risk areas. The distribution of daily essential supplies to residents in the closed areas became a major challenge for the government. This study introduces a new variant of the vehicle routing problem with travel restrictions in closed areas called the two-echelon emergency vehicle routing problem with time window assignment (2E-EVRPTWA). 2E-EVRPTWA involves transporting goods from distribution centers (DCs) to satellites in high-risk areas in the first echelon and delivering goods from DCs or satellites to customers in the second echelon. Vehicle sharing and time window assignment (TWA) strategies are applied to optimize the transportation resource configuration and improve the operational efficiency of the emergency logistics network. A tri-objective mathematical model for 2E-EVRPTWA is also constructed to minimize the total operating cost, total delivery time, and number of vehicles. A multi -objective adaptive large neighborhood search with split algorithm (MOALNS-SA) is proposed to obtain the Pareto optimal solution for 2E-EVRPTWA. The split algorithm (SA) calculates the objective values associated with each solution and assigns multiple trips to shared vehicles. A non-dominated sorting strategy is used to retain the optimal labels obtained with the SA algorithm and evaluate the quality of the multi-objective solution. The TWA strategy embedded in MOALNS-SA assigns appropriate candidate time windows to customers. The proposed MOALNS-SA produces results that are comparable with the CPLEX solver and those of the self-learning non-dominated sorting genetic algorithm-II, multi-objective ant colony algorithm, and multi-objective particle swarm optimization algorithm for 2E-EVRPTWA. A real-world COVID-19 case study from Chongqing City, China, is performed to test the performance of the proposed model and algorithm. This study helps the government and logistics enterprises design an efficient, collaborative, emergency logistics network, and promote the healthy and sustainable development of cities.
引用
收藏
页数:29
相关论文
共 50 条
  • [21] The Invulnerability of Emergency Logistics Network Based on Complex Network
    Chen, Chunxia
    Wang, Yongkang
    AFFECTIVE COMPUTING AND INTELLIGENT INTERACTION, 2012, 137 : 789 - +
  • [22] Optimization method study of fresh good logistics distribution based on time window and temperature control
    Wang Y.
    Zhang J.
    Liu Y.
    Xu M.-Z.
    Kongzhi yu Juece/Control and Decision, 2020, 35 (07): : 1606 - 1614
  • [23] The Time Window Assignment Vehicle Routing Problem
    Spliet, Remy
    Gabor, Adriana F.
    TRANSPORTATION SCIENCE, 2015, 49 (04) : 721 - 731
  • [24] Emergency Logistics Scheduling Under Uncertain Transportation Time Using Online Optimization Methods
    Zhang, Yutong
    Liu, Jing
    IEEE ACCESS, 2021, 9 : 36995 - 37010
  • [25] Grey-Theory-Based Optimization Model of Emergency Logistics Considering Time Uncertainty
    Qiu, Bao-Jian
    Zhang, Jiang-Hua
    Qi, Yuan-Tao
    Liu, Yang
    PLOS ONE, 2015, 10 (09):
  • [26] Reliable Rescue Routing Optimization for Urban Emergency Logistics under Travel Time Uncertainty
    Li, Qiuping
    Tu, Wei
    Zhuo, Li
    ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2018, 7 (02):
  • [27] Robust Optimization for Cooperative Task Assignment of Heterogeneous Unmanned Aerial Vehicles with Time Window Constraints
    Gao, Zhichao
    Zheng, Mingfa
    Zhong, Haitao
    Mei, Yu
    AXIOMS, 2025, 14 (03)
  • [28] Study on the Armed Police Emergency Logistics Network
    Xuan, Dengdian
    Guo, Xiaofen
    2011 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTATION AND INDUSTRIAL APPLICATION (ICIA2011), VOL III, 2011, : 240 - 243
  • [29] Study on the Aimed Police Emergency Logistics Network
    Xuan, Dengdian
    Guo, Xiaofen
    2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL VIII, 2010, : 240 - 243
  • [30] Research on security of transportation network to emergency logistics
    Liu, Lang
    Huang, Youfang
    PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON INTELLIGENT LOGISTICS SYSTEMS, 2008, : 451 - 459