Modeling And Solving Of Modular Scheduling Problem For Emergency Relief Supplies Based On Improved NSGA-? Algorithm

In recent years,frequent natural disasters around the world have brought tremendous loss of life and property to the people.In order to reduce the losses caused by disasters,governments generally carry out the rescue work as soon as possible after the disaster.The scheduling of emergency relief supplies is the core link of rescue work after the natural disaster,and is getting more and more attention from some departments and scholars.This paper focuses on the scheduling of emergency relief supplies,and the main work is as follows:(1)The research set forth the background,significance,topics and its characteristics,the main framework of scheduling of emergency relief supplies.The current research and work is analyzed and summarized,and the current progress and problems about the research are pointed out.(2)A multi-objective optimization model of the modular scheduling for emergency relief supplies under multi-transport mode is presented,which applies the proportionate relationship between the relief supplies.In order to adapt to the dynamics of the transportation network after the natural disaster,the model considered various modes of transportation in scheduling of supplies.(3)An improved algorithm named SN-NSGA2 which considers individual neighborhood is proposed.The idea of neighborhood in the density clustering algorithm DBSCAN is applied to new exclusion mechanism,and simultaneously a method of constructing individual neighborhood with corresponding elimination strategy is put forward.Experiments show that the new algorithm has better distribution and good convergence.(4)Make an empirical analysis to the scheduling of emergency relief supplies of K as the research object.The model of modular scheduling of supplies is applied to the example,and finally verify the validity of the model.