Abstract
The present paper focuses on the development of an algorithm for safely and optimally managing the routing of aircraft on an airport surface in future airport operations. This tool is intended to support air traffic controllers’ decision-making in selecting the paths of all aircraft and the engine startup approval time for departing ones. Optimal routes are sought for minimizing the time both arriving and departing aircraft spend on an airport surface with engines on, with benefits in terms of safety, efficiency and costs. The proposed algorithm first computes a standalone, shortest path solution from runway to apron or vice versa, depending on the aircraft being inbound or outbound, respectively. For taking into account the constraints due to other traffic on an airport surface, this solution is amended by a conflict detection and resolution task that attempts to reduce and possibly nullify the number of conflicts generated in the first phase. An example application on a simple Italian airport exemplifies how the algorithm can be applied to true-world applications. Emphasis is given on how to model an airport surface as a weighted and directed graph with non-negative weights, as required for the input to the algorithm.
Highlights
Airport operations are widely recognized to be one of the main bottlenecks of the current AirTraffic Management (ATM) system
This is done in two consecutive steps, that is, a standalone, shortest path solution from runway to apron, neglecting the presence of other aircraft on the airport surface, followed by a conflict detection and resolution task that attempts to reduce and possibly nullify the number of conflicts generated in the first phase
A standalone, shortest path solution from runway to apron, neglecting the presence of other aircraft on the airport surface, is sought for all aircraft in the planning horizon. This route, which is clearly the one yielding the minimum time the aircraft can potentially spend on the taxiways, does not take into account the constraints due to other traffic on the airport surface. This solution is amended by a conflict detection and resolution task that attempts to reduce and possibly nullify the number of conflicts generated in the first phase
Summary
Airport operations are widely recognized to be one of the main bottlenecks of the current Air. Route Planner (XRP) tool aims at minimizing the holding time of aircraft that are maneuvering on airport taxiways, for both arriving and departing aircraft This is done in two consecutive steps, that is, a standalone, shortest path solution from runway to apron (or vice versa), neglecting the presence of other aircraft on the airport surface, followed by a conflict detection and resolution task that attempts to reduce and possibly nullify the number of conflicts generated in the first phase. In this way, the computationally intractable problem is simplified by decomposition, and a suboptimal solution can always be found within a pre-specified time interval, which makes the algorithm suitable for practical use in true-world airport operations. A preliminary assessment of the algorithm’s performance is presented
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
