DocumentCode
3369815
Title
Dijkstra´s algorithm based robust optimization to airline network planning
Author
Zhang Yan ; Zhang Jun
Author_Institution
Sch. of Electron. & Inf. Eng., Beihang Univ., Beijing, China
fYear
2010
fDate
26-28 June 2010
Firstpage
2783
Lastpage
2786
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.
Keywords
airports; optimisation; planning; transportation; travel industry; Dijkstra algorithm; airline network planning; decision making process; hub aerodromes; hub-and-spoke network; robust optimization; Cities and towns; Computer applications; Costs; Decision making; Optimization methods; Process planning; Robustness; Telecommunication traffic; Traffic control; Usability; Airline Planning; Dijkstra´s Algorithm; Hub-spoke network; RobustOptimizaion;
fLanguage
English
Publisher
ieee
Conference_Titel
Mechanic Automation and Control Engineering (MACE), 2010 International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-7737-1
Type
conf
DOI
10.1109/MACE.2010.5536824
Filename
5536824
Link To Document