A Heuristic Approach for Aeromedical Evacuation System scheduling and Routing
AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING
Pagination or Media Count:
This thesis formalizes and applies a heuristic approach to the aeromedical evacuation system AES weekly scheduling problem. The study also examines algorithms that could be applied to the daily routing problem of the AES. The study had three basic objectives 1 Present a formal model that can be used to develop the weekly schedule that is used by the AES. 2 Compare the utility of having a fixed weekly as opposed to a flexible weekly schedule. 3 Examine the daily routing problem of the AES and point out major difficulties in solving the daily routing problem. This thesis found that a formal model can be utilized to solve for a weekly schedule. However, it was also discovered that the fixed weekly schedule is not the primary obstacle in the AES routing and scheduling problems. The patient demands change continuously from day to day and week to week etc..., so it is not possible to develop a schedule that will be optimal for all days of the scheduling period. Furthermore, the daily routing problem continued to be the problem that requires substantial attention. Therefore, a model is formulated that may be used to determine the daily routing of the AES. This model is an integer 0-1 program.
- Administration and Management
- Medicine and Medical Research
- Medical Facilities, Equipment and Supplies
- Escape, Rescue and Survival