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 scena rios that;are being studied by the analysis tools at the Airlift Mobility C ommand. 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 add ressed. One such issue is the use of available data in a specific input fil e format. Another crucial issue is adapting the base-to-base route set prov ided 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 r oute sets appropriately are described, and test results are provided for tw o different scenarios. Finally, recommendations that were given to the anal ysts at AMC for use of the k-shortest path routine are given. (C) 1999 Else vier Science Ltd. All rights reserved.