Abstract
In this paper, the map of a network of air routes was updated by removing the non-optimal routes and replacing them with the best ones. An integer linear programming model was developed. The aim was to find optimal routes in superspace based on performance-based navigation. The optimal routes were found from a DIJKSTRA algorithm that calculates the shortest path in a graph. Simulations with python language on real traffic areas showed the improvements brought by surface navigation. In this work, the conceptual phase and the upper airspace were studied.
Highlights
The increase in air traffic poses a real problem as control agencies have to simultaneously manage an ever-increasing number of aircrafts in already congested airspace and maintain a high level of safety
A certain amount of work has already been done on airspace sectorisation (e.g., [3] [4]), you consider the Dynamic Airspace Sectorization Problem (DASP) where airspace is partitioned into a number of sectors
In the second part of this paper, we develop an integer linear programming model and solution for this application using the shortest path algorithm, the Dijkstra algorithm
Summary
The increase in air traffic poses a real problem as control agencies have to simultaneously manage an ever-increasing number of aircrafts in already congested airspace and maintain a high level of safety. This continuous traffic growth pushes the navigation system (Conventional Navigation) to its limits and the need for alternatives with greater capacity becomes more and more urgent [1]. Navigation systems have had to undergo constant technological development. One of these developments is Area Navigation (RNAV). A new navigation method called RNAV (Area Navigation) defined by [2] at the ICAO (International Civil Aviation Organization) 4th edition 2013 conference, tries to bring new solutions
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.