A dual decomposition method for sector capacity constrained traffic flow optimization

An aggregate air traffic flow model based on a multicommodity network is used for traffic flow management in the National Airspace System. The problem of minimizing the total travel time of flights in the National Airspace System of the United States, subject to sector capacity constraints, is formulated as an Integer Program. The resulting solution achieves optimal delay control. The Integer Program implemented for the scenarios investigated has billions of variables and constraints. It is relaxed to a Linear Program for computational efficiency. A dual decomposition method is applied to solve the large scale Linear Program in a computationally tractable manner. A rounding algorithm is developed to map the Linear Program solution to a physically acceptable result, and is implemented for the entire continental United States. A 2‐h traffic flow management problem is solved with the method.