Font Size: a A A

Research On Scheduling Optimization Problem Of Emergency Materials In Post-earthquake

Posted on:2022-01-23Degree:MasterType:Thesis
Country:ChinaCandidate:X C WangFull Text:PDF
GTID:2506306341478304Subject:Management Science and Engineering
Abstract/Summary:PDF Full Text Request
In recent years,the frequent earthquake disasters has seriously affected the normal life of the people and brought huge challenges to social economic development.Effective scheduling of emergency materials is a key link for the smooth development of rescue work after the disaster.Due to the signal interruption and the destruction of roads in the disaster area,the disaster situation is uncertain and constantly changing.How to deal with the uncertain and dynamic factors in the emergency materials dispatching process and realize the scientific distribution and timely delivery is a major challenge currently.Based on the review of the existing research results on the emergency materials scheduling,the paper firstly starts from the perspective of emergency materials transportation path optimization,and obtains the optimal driving path of emergency vehicles.Then,based on it,this paper deeply studies the dynamic emergency materials scheduling under uncertain environments.In order to solve the optimal path of emergency materials transportation under uncertain environment,the paper considers the vehicle travel time,road communication capability and road transportation risk,and uses chance-constrained programming method to establish a multi-objective model for the emergency materials optimization transportation path under uncertain environment.Based on the credibility theory,the fuzzy opportunity constraints are transformed into clear equivalent forms.The extreme value method is used to process the path index attributes non-dimensionally.Finally,the Dijkstra algorithm is used to solve the model.It lays a foundation to establish a multi-objective model for dynamic emergency materials scheduling under uncertain environment.After obtaining the optimal driving path from the supply points to the demand points,based on this,the paper establishes a multi-objective model for dynamic emergency materials scheduling under uncertain environments.Considering the impact of the urgency of emergency materials demand and the utility of materials on the fairness of material distribution and the distribution timeliness.The fairness goal is to minimize the difference in the satisfaction rate of materials demand among the disaster sites,the timeliness goal is to minimize the material delivery time,and the economic goal is to minimize material transportation and inventory costs.Using the chance-constrained programming method,based on the credibility theory,the fuzzy opportunity constraint conditions are transformed into clear equivalent form.For dynamic problems,the rolling time domain strategy is used to transform it into a series of discrete moment static problems.The fast and elitist non-dominated sorting generic algorithm is designed,and the global optimal approximation idea is used to obtain the multi-objective Pareto optimal solution set.At the end of the paper,the emergency materials scheduling work in disaster area is taken as an example to verify the model and solution method.Based on MATLAB software,Firstly the paper uses the Dijkstra algorithm to solve the optimal driving path of emergency vehicles,and then uses NSGA-II to solve the example.It is verified by examples that the algorithm designed in this paper can produce effective Pareto optimal solutions and Pareto frontiers.The fairness,timeliness and economic goals of the model have been taken into consideration.Decision makers can choose appropriate emergency materials scheduling plan according to the actual situation of the disaster area in the current period.The plan reduces the cost of material transportation and inventory on the basis of meeting fairness and timeliness.
Keywords/Search Tags:emergency materials scheduling optimization, optimal path, dynamic decision, fuzzy chance-constrained model, fast and elitist non-dominated sorting generic algorithm
PDF Full Text Request
Related items