A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems

Xu, J and Sohoni, M G and McCleery, M and Bailey, T G (2006) A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems. European Journal of Operational Research, 169 (3). 978 - 993.

Full text not available from this repository. (Request a copy)


The multi-objective flight instructor scheduling problem is an optimization problem that schedules instructors to teach a set of pilot training events. The objectives of the problem are to minimize labor cost, maximize workload consistency and maximize flight instructor satisfaction of their assignments. The problem is further complicated by various hard and soft constraints. We study a multi-objective cost function and convert it to a scalar-weighted objective function using a priori weighting scheme. We then design an efficient dynamic neighborhood based tabu search meta-heuristic to solve the problem. The algorithm exploits the special properties of different types of neighborhood moves. We also address issues of solution domination, tabu short-term memory, dynamic tabu tenure and aspiration rule. The application of the algorithm in a major US airline carrier is reported and the results show that our algorithm achieves significant benefits in practice.

Affiliation: Indian School of Business
ISB Creiators:
ISB Creators
Sohoni, M G
Item Type: Article
Uncontrolled Keywords: Multi-objective flight instructor scheduling problem, Tabu search, Meta-heuristic
Subjects: Operations Management
Depositing User: Veeramani R
Date Deposited: 03 Apr 2019 08:38
Last Modified: 03 Apr 2019 08:38
URI: http://eprints.exchange.isb.edu/id/eprint/738
Publisher URL: https://doi.org/10.1016/j.ejor.2004.08.023
Publisher OA policy: http://sherpa.mimas.ac.uk/romeo/issn/0377-2217/
Related URLs:

Actions (login required)

View Item View Item
Statistics for DESI ePrint 738 Statistics for this ePrint Item