Search

A linear time-varying aggregate traffic flow model can be used to develop traffic flow management strategies using optimization algorithms. However, there are few methods available in the literature to translate these aggregate solutions into practical control actions involving individual aircraft. In this paper, a computationally efficient disaggregation algorithm is proposed by employing a series of linear program and mixed integer linear program methods, which converts an aggregate (flow-based) solution to a flight-specific control action. Numerical results generated by the optimization method and the disaggregation algorithm are presented and illustrated by applying them to generate traffic flow management schedules for a typical day in the U.S. National Airspace System. [ABSTRACT FROM AUTHOR]

The article presents a solution to a large-scale traveling-salesman problem which shows that a certain tour of 49 cities, one in each of the 48 states and Washington, D.C., has the shortest road distance. A brief history of the problem is provided. A city in each state including the District of Columbia was selected to try the optimal path method on a large problem. The devices in obtaining solutions include the use of undirected tours, the imposition of linear conditions to characterize the tours, the speeding up of the iterative process and the use of a combinatorial approach.