Title :
Emergency supplies´ two transport scheduling model
Author :
Lu, Zheng ; Sihui, Luo
Author_Institution :
Coll. of Autom., Chongqing Univ., Chongqing, China
Abstract :
We can resolve the emergency logistics scheduling problems in two steps. Firstly, determining the shortest path between the save point and the disaster point. Secondly, choosing the optimal transportation solution from the save point to the disaster point. By these two steps, the model based on dynamic optimization of the shortest path method and model based on multi-objective emergency linear programming of multi-rescue could be established. Then, the validity and reference of the models could be sufficiently proved by getting the estimating solution simply, fast and accurately by the inverse method and simplex method respectively, or by using the LINGO, and listing examples.
Keywords :
dynamic programming; emergency services; inverse problems; linear programming; scheduling; supply chains; transportation; LINGO; dynamic optimization; emergency logistic scheduling problem; emergency supply; inverse method; multiobjective emergency linear programming; shortest path method; simplex method; transport scheduling model; transportation solution; Decision making; Dynamic programming; Dynamic scheduling; Linear programming; Materials; Optimal scheduling; Transportation; Dynamic Programming; Emergency Scheduling; LINGO; Multi-objective linear programming; emergency logistics; shortest path method;
Conference_Titel :
Transportation, Mechanical, and Electrical Engineering (TMEE), 2011 International Conference on
Conference_Location :
Changchun
Print_ISBN :
978-1-4577-1700-0
DOI :
10.1109/TMEE.2011.6199574