Exact approaches for integrated aircraft fleeting and routing at TunisAir

  • Authors:

  • Mohamed Haouari;Hanif D. Sherali;Farah Zeghal Mansour;Najla Aissaoui

  • Affiliations:

  • Department of Industrial Engineering, Ozyegin University, Istanbul, Turkey and Princess Fatimah Alnijris' Research Chair for AMT, College of Engineering, King Saud University, Riyadh, Saudi Arabia;Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, USA 24061;Combinatorial Optimization Research Group--ROI, Ecole Polytechnique de Tunisie, La Marsa, Tunisia 2078;Combinatorial Optimization Research Group--ROI, Ecole Polytechnique de Tunisie, La Marsa, Tunisia 2078

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We describe models and exact solutions approaches for an integrated aircraft fleeting and routing problem arising at TunisAir. Given a schedule of flights to be flown, the problem consists of determining a minimum cost route assignment for each aircraft so as to cover each flight by exactly one aircraft while satisfying maintenance activity constraints. We investigate two tailored approaches for this problem: Benders decomposition and branch-and-price. Computational experiments conducted on real-data provide evidence that the branch-and-price approach outperforms the Benders decomposition approach and delivers optimal solutions within moderate CPU times. On the other hand, the Benders algorithm yields very quickly high quality near-optimal solutions.