On the Problem of Constructing Routes, Part II: Methodology and Numerical Example

V. K. Linis and M. S. Maksim

Abstract

We consider a periodic aviation schedule which is a finite collection of flights with given arrival/departure times. For this schedule, we solve the problem of finding the minimal number of aircrafts needed to carry out the flights. The crucial role in solving this problem is played by so-called deficit function (DFs) defined as the difference between departures and arrivals on interval [0,t] for each terminal.

If the inline PDF is not rendering correctly, you can download the PDF file here.

OPEN ACCESS

Journal + Issues

Search