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 条
  • [31] Traffic Assignment Model Based on Priority of Emergency Logistics and Its Algorithm
    Ding L.
    Hang H.
    Tongji Daxue Xuebao/Journal of Tongji University, 2022, 50 (05): : 630 - 634
  • [32] STUDY ON VEHICLE ROUTING OPTIMIZATION OF COLD CHAIN LOGISTICS WITH SOFT TIME WINDOW UNDER STOCHASTIC DEMAND
    Yan, Liying
    Zheng, Pengjun
    UNIVERSITY POLITEHNICA OF BUCHAREST SCIENTIFIC BULLETIN SERIES C-ELECTRICAL ENGINEERING AND COMPUTER SCIENCE, 2020, 82 (03): : 167 - 178
  • [33] Routing and Wavelength Assignment in a Satellite Optical Network Based on Ant Colony Optimization With the Small Window Strategy
    Dong, Yi
    Zhao, Shanghong
    Ran, Hao Dan
    Li, Yongjun
    Zhu, Zihang
    JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 2015, 7 (10) : 995 - 1000
  • [34] An optimization model of cross-docking scheduling of cold chain logistics based on fuzzy time window
    Lian, Jie
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 41 (01) : 1901 - 1915
  • [35] Research on Routing Optimization Problem of Cigarette Logistics Vehicle with Time Window Based on Hybrid Genetic Algorithm
    Fan, Wenbin
    Feng, Wen
    PROCEEDINGS OF THE 2017 7TH INTERNATIONAL CONFERENCE ON EDUCATION, MANAGEMENT, COMPUTER AND SOCIETY (EMCS 2017), 2017, 61 : 658 - 668
  • [36] Study on vehicle routing optimization of cold chain logistics with soft time window under stochastic demand
    Yan, Liying
    Zheng, Pengjun
    UPB Scientific Bulletin, Series C: Electrical Engineering and Computer Science, 2020, 82 (03): : 167 - 178
  • [37] Optimization of perishable agricultural products logistics distribution path based on IACO-time window constraint
    Miao, Xiaohong
    Pan, Sujuan
    Chen, Lei
    INTELLIGENT SYSTEMS WITH APPLICATIONS, 2023, 20
  • [38] Optimization and Prediction of Logistics Network Structure
    Liu, Zhuo
    Qian, Weiyi
    Wang, Lei
    International Conference on Applied Intelligence and Sustainable Computing, ICAISC 2023, 2023,
  • [39] Simulation Research of Space-Time Evolution of Emergency Logistics Network Reliability Based on Complex Network Theory
    Huang, Li
    Wang, Wei
    Wang, Minggong
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2013, 2013
  • [40] The discrete time window assignment vehicle routing problem
    Spliet, Remy
    Desaulniers, Guy
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 244 (02) : 379 - 391