Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481138 | European Journal of Operational Research | 2009 | 9 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Mohamed Haouari, Najla Aissaoui, Farah Zeghal Mansour,