Optimizing Airline Networks: A Comparative Analysis of Graph-Based Techniques

In the vast expanse of global travel, the intricate web of interconnected airline networks serves as the lifeline of modern aviation. Amidst the bustling realm of global aviation, where time and resources are of the essence, the optimization of airline networks emerges as a paramount pursuit, unleashing the power to streamline operations, enhance connectivity, and elevate the travel experience for passengers worldwide. In this paper, four prominent graph-based algorithms, namely A*, Bellman-Ford, bidirectional search, and Dijkstra’s algorithm, were used and compared for optimization of airline networks. These algorithms leverage the inherent structure of the airways network, represented as a graph, to determine the most efficient routes. By evaluating the execution times, path lengths, and complexities of these algorithms, this research equips the airline industry with valuable insights for optimizing airways path-finding. With optimized path-finding, the skies become more navigable, fostering a seamless travel experience for passengers and bolstering the economic growth driven by the aviation sector.