Dijkstra's algorithm based robust optimization to airline network planning
Yan Zhang, Zhang Jun
Abstract
Yan Zhang, Zhang Jun
Abstract
This paper applies Robust Optimization method to optimize the airline network planning process. The Dijkstra's Algorithm is firstly introduced to improve the initial solution and neighborhood structure. And the Robust Optimization method is applied to the problem of selecting the hub aerodromes in the airline network to help the decision making process. Furthermore, a hub-and-spoke network among 15 cities is constructed with the method application. The computation result shows its good usability in airline optimization solution. Consequently, the method can be used to instruct the airline network optimization in China.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper applies Robust Optimization method to optimize the airline network planning process. The Dijkstra's Algorithm is firstly introduced to improve the initial solution and neighborhood structure. And the Robust Optimization method is applied to the problem of selecting the hub aerodromes in the airline network to help the decision making process. Furthermore, a hub-and-spoke network among 15 cities is constructed with the method application. The computation result shows its good usability in airline optimization solution. Consequently, the method can be used to instruct the airline network optimization in China.
Key concepts: Dijkstra's algorithm, Computer science, Computation, Usability, Process (computing), Mathematical optimization, Optimization problem, Algorithm