Have a personal or library account? Click to login
On the Problem of Constructing Routes, Part II: Methodology and Numerical Example Cover

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

By: V. K. Linis and  M. S. Maksim  
Open Access
|Jun 2017

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.

DOI: https://doi.org/10.1515/ttj-2017-0021 | Journal eISSN: 1407-6179 | Journal ISSN: 1407-6160
Language: English
Page range: 234 - 239
Published on: Jun 27, 2017
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2017 V. K. Linis, M. S. Maksim, published by Transport and Telecommunication Institute
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.