Font Size: a A A

Research On Network Optimization Problem Of Emergency Logistics Distribution

Posted on:2011-12-17Degree:MasterType:Thesis
Country:ChinaCandidate:Z LiFull Text:PDF
GTID:2189360332957201Subject:Traffic and Transportation Engineering
Abstract/Summary:PDF Full Text Request
With the social and economic development, population, resources, transportation, environmental and other social problems have become increasingly prominent, meanwhile, the natural disaster also frequently occurs. Emergencies and incidents already have been harming China's economic development and the social stability. Dispatch problems, which are about Emergency Logistics Distribution in the emergencies and incidents, have been the focus in our country. Emergency logistics systems should meet the demand of the emergency logistics in the constraint condition of the limited time, the space and the resources, which can realizes the maximization of the time benefit and the minimum of the disaster loses. This dissertation takes the network of Emergency Logistics Distribution as its object, and takes use of the Shortest-path theory to establish the mathematical models on the network of Emergency Logistics Distribution, and then to optimize it. It will therefore find out the optimized distribution network to meet the requirement of multiple objective functions with update constraints. It is helpful to enhance the validity and the high response speed of Emergency Logistics Distribution, at the same time to support dispatch decision-making on the emergency logistics.This dissertation aims at three kinds of sharp-edged situations about the network of Emergency Logistics Distribution, as follows: the first is that cost of distribution network happens to charge; the second is that emergencies and incidents cause some road to be broken; the third is that, because existing network is unsmooth, it needs to rebuild another road. According to the above three kinds of situations, the paper adopts shortest-path concept model based on the graph theory, and it abstract three kinds of the conditions on the shortest-path problem, as follows: the first is that weights on the arc have to charge (fill out or trail off); the second is that an arc of the network has been deleted; the third is that an arc of the network has been added. Proceed to the next step, it goes to theoretical analysis and has given the solution and algorithm design for each condition. It uses Dijkstra and Floyd arithmetic, and obtains the optimal solution with the editing routine. Meanwhile, it takes the simulation experiment in the case.This dissertation has not been able to enumerate each kind of possibility situation on the dispatch problems of the Emergency Logistics, and the establishment of the theoretical model has not considered resources conflict of the multi-objective decision about the Emergency Logistics(the constraints cannot be satisfied completely), which makes influence to result of the strategic decision. All of these will be as one of research areas to continue studying.
Keywords/Search Tags:Network Optimization, Emergency Logistics Distribution, Shortest-path Problem
PDF Full Text Request
Related items