Formulation and Solution of the tail assignment problem

Аuthors

, Stankevich A. M.^*

Moscow Aviation Institute (National Research University), 4, Volokolamskoe shosse, Moscow, А-80, GSP-3, 125993, Russia

*e-mail: stan@inmas.ru

Abstract

This paper is dedicated to the tail assignment problem, which appears on the last stage of the aircraft scheduling process. It is shown how to formulate the problem in terms of the well-known single commodity network model that allows solving it with highly efficient network optimization algorithms. A technique to handle additional constraints for individual aircrafts is proposed.

Keywords:

airline scheduling, tail assignment problem, single commodity network model, network optimization algorithms