Route Network Optimization in the Dakar Airspace: Surface Navigation

Authors

  • Mint Elhassen Emani Cheikh Anta Diop University, Dakar, Senegal.
  • Amadou Coulibaly Cheikh Anta Diop University, Dakar, Senegal.
  • Salimata G. Diagne Cheikh Anta Diop University, Dakar, Senegal.
  • Ahmedou Ould Haouba University of Nouakchott AL Aasriya, Nouakchott, Mauritanie.
  • Alain Ngoma Mby Agency for Aerial Navigation Safety in Africa and Madagascar, Dakar, Senegal.

DOI:

https://doi.org/10.9734/bpi/costr/v1/7300F

Keywords:

Airspace, linear optimization, graph theory, dijkstra algorithm, performance-based navigation, conventional navigation

Abstract

In this study, the map of a network of air routes was upgraded by deleting the non-optimal routes and substituting the best ones. A linear programming model for integers was created. The goal was to find optimal routes in superspace using performance-based navigation. The shortest path in a graph is determined via the DIJKSTRA method, which is how the best routes were discovered. The benefits of surface navigation were demonstrated in simulations using the Python programming language in locations with heavy traffic. The conceptual stage and the higher airspace were investigated in this work.

Published

2022-08-05

How to Cite

Mint Elhassen Emani, Amadou Coulibaly, Salimata G. Diagne, Ahmedou Ould Haouba, & Alain Ngoma Mby. (2022). Route Network Optimization in the Dakar Airspace: Surface Navigation. Current Overview on Science and Technology Research Vol. 1, 142–163. https://doi.org/10.9734/bpi/costr/v1/7300F

Issue

Current Overview on Science and Technology Research Vol. 1

Section

Chapters