By Topic

Reducing air traffic delay in a space-time network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Helme, M.P. ; MITRE Corp., McLean, VA, USA

The author describes a formulation of National Airspace System (NAS) traffic management problem as a multicommodity minimum cost flow problem over a network in space-time. It is a formulation of the multidestination delay minimization problem of managing traffic in the NAS. The model's potential for improving over present practice is described in terms of six assumptions of present practice. The space-time network model can address uncertainty in capacity values, restrictive airways capacities, and hubbing. The minimum cost flow formulation further assumes that attempted entries into the system are deterministic, not Poisson, and that actual entries are controllable. The formulation specifically allows dynamic capacities and possesses good potential for short execution time

Published in:

Systems, Man and Cybernetics, 1992., IEEE International Conference on

Date of Conference:

18-21 Oct 1992