Open AccessComparative Evaluation of Path Finding in All Pair Shortest Path Problem for Airline Network
Author(s) -
Nadia Moqbel Hassan Al-Zubaydi
Publication year - 2020
Publication title -
xi'nan jiaotong daxue xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 21
ISSN - 0258-2724
DOI - 10.35741/issn.0258-2724.55.4.3
Subject(s) - shortest path problem , k shortest path routing , constrained shortest path first , computer science , routing (electronic design automation) , path (computing) , private network to network interface , yen's algorithm , average path length , equal cost multi path routing , selection (genetic algorithm) , mathematical optimization , computer network , graph , link state routing protocol , routing protocol , dijkstra's algorithm , mathematics , theoretical computer science , artificial intelligence
In the field of geoformation and transportation science, the shortest path is calculated on graph mostly found in road and transportation networks, especially the network of airports of some capitals around the globe. Against this backdrop, the present paper follows Geographic Information Systems to investigate the real distance for the airline in order to achieve an optimal aircraft routing within a dynamically stochastic transportation network. Routing is a procedure of forwarding the data from a known seed to the goal in which the data may travel through several intermediate routes. Consequently, the selection of the best possible shortest path nodes to forward the data using all pair shortest path is necessitated. Moreover, as a result of this approach, this shortest path selection of nodes will help facilitate the attainment of an efficient performance in the network. Copious amounts of work have been carried out to discover the shortest path in the network routing for the purpose of improving its efficiency and overcoming possible problems.