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

Open access

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.

Search
Journal information
Impact Factor


Cite Score 2018: 1.19

SCImago Journal Rank (SJR) 2018: 0.251
Source Normalized Impact per Paper (SNIP) 2018: 0.982

Metrics
All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 219 105 7
PDF Downloads 108 69 6