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

Abstract

    <jats:p> 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.

Document type: Article

Full document

Original document

The different versions of the original document can be found in:

• https://content.sciendo.com/downloadpdf/journals/ttj/18/3/article-p234.pdf under the license https://creativecommons.org/licenses/by-nc-nd

• http://www.degruyter.com/view/j/ttj.2017.18.issue-3/ttj-2017-0021/ttj-2017-0021.xml?format=INT,

https://doaj.org/toc/1407-6179 under the license cc-by-nc-nd

• https://content.sciendo.com/view/journals/ttj/18/3/article-p234.xml,

http://www.degruyter.com/view/j/ttj.2017.18.issue-3/ttj-2017-0021/ttj-2017-0021.pdf,

http://dx.doi.org/10.1515/ttj-2017-0021

• https://content.sciendo.com/view/journals/ttj/18/3/article-p234.xml,

https://core.ac.uk/display/88593251,

https://academic.microsoft.com/#/detail/2725501192 under the license http://creativecommons.org/licenses/by-nc-nd/4.0