By Topic

Using dynamic flow network modeling for aircraft route assignment

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

4 Author(s)
Nace, D. ; Heudiasyc Lab., Univ. de Technol. de Compiegne, France ; Carlier, J. ; Nhat Linh Doan ; Duong, V.

In this study we present a deterministic model based on a linear programming approach for optimizing the route assignment in a trajectory-based Air Traffic Management (ATM) environment. This study is essentially intended to reduce the airspace congestion through an appropriate route assignment. The latter one can be easily seen as a multi-period (dynamic) problem. Indeed, the time dimension is an essential ingredient to consider when constructing flight plans for a large number of flights and evaluating the number of potential en-route conflicts. This dynamic problem can be transformed into a static one by using standard technique of time-expanding the underlying network. We propose here a model to consider the airspace congestion in a finer way: we consider the number of aircraft involved in potential en-route conflicts rather than the number of aircraft in a sector, sometimes implicitly understood as en-route capacities in ATM. In other words, the routing computing which is the choice of the most appropriate routes with respect to congestion avoidance (in terms of the number of potential en-route conflicts) and economical considerations are our main concern.

Published in:

Digital Avionics Systems Conference, 2002. Proceedings. The 21st  (Volume:1 )

Date of Conference:

2002