Journal of shanghai Jiaotong University (Science) ›› 2013, Vol. 18 ›› Issue (2): 243-252.doi: 10.1007/s12204-013-1389-y

• Articles • Previous Articles     Next Articles

Solving Airlines Disruption by Considering Aircraft and Crew Recovery Simultaneously

Solving Airlines Disruption by Considering Aircraft and Crew Recovery Simultaneously

LE Mei-long* (乐美龙), WU Cong-cong (吴聪聪)   

  1. (Scientific Research Academy, Shanghai Maritime University, Shanghai 201306, China)
  2. (Scientific Research Academy, Shanghai Maritime University, Shanghai 201306, China)
  • Online:2013-04-30 Published:2013-05-10
  • Contact: LE Mei-long(乐美龙) E-mail:meilongle@hotmail.com

Abstract: When disruptions occur, the airlines have to recover from the disrupted schedule. The recovery usually consists of aircraft recovery, crew recovery and passengers’ recovery. This paper focuses on the integrated recovery, which means above-mentioned two or more recoveries are considered as a whole. Taking the minimization of the total cost of assignment, cancellation and delay as an objective, we present a more practical model, in which the maintenance and the union regulations are considered. Then we present a so-called iterative tree growing with node combination method. By aggregating nodes, the possibility of routings is greatly simplified, and the computation time is greatly decreased. By adjusting the consolidating range, the computation time can be controlled in a reasonable time. Finally, we use data from a main Chinese airline to test the algorithm. The experimental results show that this method could be used in the integrated recovery problem.

Key words: aircraft recovery| crew recovery| integrated recovery| airlines optimal recovery

摘要: When disruptions occur, the airlines have to recover from the disrupted schedule. The recovery usually consists of aircraft recovery, crew recovery and passengers’ recovery. This paper focuses on the integrated recovery, which means above-mentioned two or more recoveries are considered as a whole. Taking the minimization of the total cost of assignment, cancellation and delay as an objective, we present a more practical model, in which the maintenance and the union regulations are considered. Then we present a so-called iterative tree growing with node combination method. By aggregating nodes, the possibility of routings is greatly simplified, and the computation time is greatly decreased. By adjusting the consolidating range, the computation time can be controlled in a reasonable time. Finally, we use data from a main Chinese airline to test the algorithm. The experimental results show that this method could be used in the integrated recovery problem.

关键词: aircraft recovery| crew recovery| integrated recovery| airlines optimal recovery

CLC Number: