Routing airlift aircraft by the double-sweep algorithm

In this paper, we describe the problem of modeling the routing of aircraft across a network of enroute bases. This is done to provide routes for scenarios that are being studied by the analysis tools at the Airlift Mobility Command. We are primarily concerned with the development of routes that can be easily implemented with the airlift operations analysis tools in use at AMC. We will describe the specific implementation issues that have been addressed. One such issue is the use of available data in a specific input file format. Another crucial issue is adapting the base-to-base route set provided by the double-sweep algorithm into a region-to-region route set which can be used by the airlift analysis models. The methods used to adapt the route sets appropriately are described, and test results are provided for two differnt scenarios. Fianlly, recommendations that were given to the analysts at AMC for use of the k-shortest path routine are given.