| Summary: | 碩士 === 國立成功大學 === 工業與資訊管理學系 === 104 === The aim of this study included developing mathematical models of optimal ambulance redeployment for shipping mass casualties in an emergency medical services system by using integer programming. Additionally, the objectives of the study involved minimizing the total waiting time for casualties. In the study, two ambulance redeployment problems, namely (1) Ambulance Dispatching Problem with the Initial Location provided, and (2) Ambulance Dispatching Problem with a Flexible initial Location, were investigated. It was assumed that the number of event points, hospitals, and patients were given for both problems. Although both problems required solving for optimal ambulance routings, the latter problem focused more on initial ambulance deployment. An integer programming model was formulated on a time space network for the first problem. However, the model was extremely time consuming. This was followed by developing a greedy heuristics based on a nearest first concept, in which the ambulance closest to a casualty was assigned to the casualty. In order to derive a fair waiting time, another heuristics that allowed each casualty to have a more equal waiting time was also employed. With respect to the second problem, certain properties of optimal redeployment were first derived for a hospital case, and then greedy heuristics were derived for other general cases. Unfortunately, a specific relationship between the optimal number of ambulances and the distance of the number of casualties to event points could not be derived from the results of the study.
|
|---|
