Network flow-based approaches for integrated aircraft fleeting and routing |
| |
Authors: | Mohamed Haouari Najla Aissaoui Farah Zeghal Mansour |
| |
Institution: | 1. Combinatorial Optimization Research Group – ROI, Ecole Polytechnique de Tunisie, BP 743, 2078 La Marsa, Tunisia;2. Department of Industrial Engineering, Ecole Nationale d’Ingénieurs de Tunis, El Manar, Tunisia |
| |
Abstract: | Given a schedule of flights to be flown, the aircraft fleeting and routing problem (AFRP) consists of determining a minimum-cost route assignment for each aircraft so as to cover each flight by exactly one aircraft while satisfying maintenance requirements and other activity constraints. We investigate network flow-based heuristic approaches for this problem. Computational experiments conducted on real-data given by TunisAir show that the proposed heuristic consistently yields very near-optimal solutions while requiring modest CPU effort. |
| |
Keywords: | OR in airlines Airline fleet assignment Aircraft routing Network flows |
本文献已被 ScienceDirect 等数据库收录! |