Accession Number : ADA262577


Title :   Patient Scheduling and Aircraft Routing for Strategic Aeromedical Evacuation


Descriptive Note : Master's thesis


Corporate Author : AIR FORCE INST OF TECH WRIGHT-PATTERSONAFB OH SCHOOL OF ENGINEERING


Personal Author(s) : Loftus, Michael J


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a262577.pdf


Report Date : Mar 1993


Pagination or Media Count : 102


Abstract : The objective of this study is to develop an approach that would assign patients to aeromedical evacuation aircraft and route each aircraft to a single CONUS airport. The goal is to minimize total patient wait time. A heuristic algorithm is developed which exploits the structure of the problem. The first subproblem solved is the assignment of aircraft to airports. This subproblem is solved using integer programming and the results are input into the second subproblem. The second subproblem is the patient to aircraft assignment problem. This subproblem minimizes patient wait time and is solved using network flow programming. The two subproblem are linked into one algorithm and solved iteratively until termination criteria are met. The algorithm is tested on three data sets. The results indicate that the algorithm is an efficient method for scheduling patients and routing aircraft, although optimality is not guaranteed.... Aeromedical evacuation, Integer program, Minimum cost flow, Heuristic algorithm.


Descriptors :   *ALGORITHMS , *SCHEDULING , *PATIENTS , *AEROMEDICAL EVACUATION , INPUT , AIRCRAFT , STRATEGY , COMPUTER PROGRAMMING , INTEGER PROGRAMMING , PROBLEM SOLVING , TIME , COSTS , ALLOCATIONS , ROUTING , FLOW , HEALTH CARE FACILITIES , FLIGHT PATHS , AIRPORTS , DAILY OCCURRENCE , EVACUATION , NETWORK FLOWS , APPROACH


Subject Categories : Operations Research
      Life Support Systems


Distribution Statement : APPROVED FOR PUBLIC RELEASE