| Summary: | 碩士 === 中原大學 === 資訊管理研究所 === 92 === Because of natural disasters happen in Taiwan frequently, mainly aiming at the problem of how to distribute the limited medical resources and to plan emergency disaster measures, we design a Safety Transfer Medical Assignment Algorithm for Emergency Medical Services to let patients whose situation are better now transfer to the other hospital in the cause of accepting new patients.
The research method we use is to transform our research problem into a mathematical programming. The objective function of this mathematical programming is to ensure the sum of all patients whose survival time is maximum, and we build some constraint to fit the limits of capacity of hospital, amount of ambulances, and safety transfer limits.
Because our research problem is NP-complete problem, therefore we will apply the Lagrangean Relaxation method to solve this problem.
We experimented with two scenarios, multi disaster area scenario and scenario of cooperating with air police service department. Base on the result of experiment, we prove our algorithm will improve the result of shortest path method for 60% to 90%. Therefore, our algorithm is much better then shortest path method in emergency disaster problem.
|
|---|
