Abstract: In recent times, the problems of efficiency and marginal productivity in the air transportation industry have become one of a global concern, particularly, in Nigeria. Safer and faster movement of passengers and their luggages in a record time with drastic reduction in the running cost are bottlenecks facing the aviation industry. The Traditional Dijkstra’s Algorithm could determine shortest path in air route distance but its exiting mechanism leads it to infinite loop. Based on this, the research sought to deploy Modified Dijkstra’s Algorithm in the planning, calculation and implementation of air route network to determine the shortest path distance. The approach employed the Comparison Addition Model (CAM) in determining the optimal distance from the source to the destination within the network. Permutation and combination analysis was used to determine all possible routes. Multiple parameters (time factor optimization, congestion reduction, memory utilization) capable of determining the shortest and optimal distance a flight can possibly travel in a routing network were handled. Python Programming Language was proficient for its coding. The performance evaluation of Modified Dijkstra’s Algorithm and Traditional Dijkstra’s algorithm based on F_1 Score, Recall and Precision was carried. The Modified Dijkstra’s Algorithm was found to perform better than the Traditional Dijkstra’s Algorithm.

Keywords: Modified Dijkstra Algorithm (MDA), Comparison Addition Model (CAM), Shortest Path Air Route Network, Air Transportation

Mba, Uchenna Ewa , Mbeledogu, N. Njideka,"SHORTEST PATH SYSTEM FOR NIGERIAN AIR DISPATCH NETWORK USING MODIFIED DIJKSTRA’S ALGORITHM", IJARCCE International Journal of Advanced Research in Computer and Communication Engineering, vol. 13, no. 2, 2024, Crossref https://doi.org/10.17148/IJARCCE.2024.13229.

PDF | DOI: 10.17148/IJARCCE.2024.13229

Open chat
Chat with IJARCCE