A Multi-objective Evolutionary Algorithm for Emergency Logistics Scheduling in Large-scale Disaster Relief

被引:0
|
作者
Gan, Xiaohui [1 ]
Liu, Jing [1 ]
机构
[1] Xidian Univ, Key Lab Intelligent Percept & Image Understanding, Minist Educ, Xian 710071, Shaanxi, Peoples R China
基金
中国国家自然科学基金;
关键词
emergency logistics scheduling; disaster relief; multi-objective evolutionary algorithm; non-dominated sorting; GENETIC ALGORITHM; MANAGEMENT; SEARCH;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The emergency logistics scheduling (ELS) is to enable the dispatch of emergency supplies to the victims of disasters timely and effectively, which plays a crucial role in large-scale disaster relief. In this paper, we first design a new multi-objective model that considers both the total unsatisfied time and transportation cost for the ELS problem in large-scale disaster relief (ELSP-LDR), which is on the scenery of multi-disasters and multi-suppliers with several kinds of resources and vehicles. Then, a modified non-dominated sorting genetic algorithm II (mNSGA-II) is proposed to search for a variety of optimal emergency scheduling plans for decision-makers. With the intrinsic properties of ELSP-LDR in mind, we design three repair operators to generate improved feasible solutions. Compared with the original NSGA-II, a local search operator is also designed for mNSGA-II, which significantly improves the performance. We conduct two experiments (the case of Chi-Chi earthquake and Great Sichuan Earthquake) to validate the performance of the proposed algorithm.
引用
收藏
页码:51 / 58
页数:8
相关论文
共 50 条
  • [31] Multi-objective evolutionary clustering for large-scale dynamic community detection
    Yin, Ying
    Zhao, Yuhai
    Li, He
    Dong, Xiangjun
    [J]. INFORMATION SCIENCES, 2021, 549 : 269 - 287
  • [32] Evolutionary Computation for Large-scale Multi-objective Optimization: A Decade of Progresses
    Hong, Wen-Jing
    Yang, Peng
    Tang, Ke
    [J]. INTERNATIONAL JOURNAL OF AUTOMATION AND COMPUTING, 2021, 18 (02) : 155 - 169
  • [33] Benchmarking large-scale subset selection in evolutionary multi-objective optimization
    Shang, Ke
    Shu, Tianye
    Ishibuchi, Hisao
    Nan, Yang
    Pang, Lie Meng
    [J]. INFORMATION SCIENCES, 2023, 622 : 755 - 770
  • [34] Evolutionary Computation for Large-scale Multi-objective Optimization: A Decade of Progresses
    Wen-Jing Hong
    Peng Yang
    Ke Tang
    [J]. Machine Intelligence Research, 2021, 18 (02) : 155 - 169
  • [35] A multi-objective evolutionary algorithm for multi-period dynamic emergency resource scheduling problems
    Zhou, Yawen
    Liu, Jing D
    Zhang, Yutong
    Gan, Xiaohui
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2017, 99 : 77 - 95
  • [36] Hybridizing a multi-objective simulated annealing algorithm with a multi-objective evolutionary algorithm to solve a multi-objective project scheduling problem
    Yannibelli, Virginia
    Amandi, Analia
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (07) : 2421 - 2434
  • [37] A novel multi-objective programming model of relief distribution for sustainable disaster supply chain in large-scale natural disasters
    Cao, Cejun
    Li, Congdong
    Yang, Qin
    Liu, Yang
    Qu, Ting
    [J]. JOURNAL OF CLEANER PRODUCTION, 2018, 174 : 1422 - 1435
  • [38] Emergency Logistics in a Large-Scale Disaster Context: Achievements and Challenges
    Jiang, Yiping
    Yuan, Yufei
    [J]. INTERNATIONAL JOURNAL OF ENVIRONMENTAL RESEARCH AND PUBLIC HEALTH, 2019, 16 (05)
  • [39] A Reduced Mixed Representation Based Multi-Objective Evolutionary Algorithm for Large-Scale Overlapping Community Detection
    Luo, Yongkang
    Zhang, Kening
    Yang, Haipeng
    Liu, Feng
    Luo, Shuai
    Zhang, Lei
    Sun, Xiaoyan
    [J]. 2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 2435 - 2442
  • [40] An evolutionary algorithm based on rank-1 approximation for sparse large-scale multi-objective problems
    Chen, Xiyue
    Pan, Jing
    Li, Bin
    Wang, Qingzhu
    [J]. SOFT COMPUTING, 2023, 27 (21) : 15853 - 15871