elib
DLR-Header
DLR-Logo -> http://www.dlr.de
DLR Portal Home | Imprint | Privacy Policy | Contact | Deutsch
Fontsize: [-] Text [+]

OPTIMIZATION OF RUNWAY CAPACITY UTILIZATION IN THE CASE OF GENERAL PARETO CURVE

Gluchshenko, Olga (2012) OPTIMIZATION OF RUNWAY CAPACITY UTILIZATION IN THE CASE OF GENERAL PARETO CURVE. ICAS 2012, 28th International Congress of the Aeronautical Sciences, 23.-28.09.2012, Brisbane, Australien.

Full text not available from this repository.

Abstract

This paper studies an essential application of Air Traffic Management investigating the runway capacity allocation with the aim of pretactical planning in the time scope of approximately 24 hours. For the prediction and solving of traffic problems for such planning horizon we have to control flows of aggregated flights rather than individual flights. Hence, the length of the queue arising from a capacity allocation decision is the main feature of flow management. Related standard key performance indicators such as throughput, delay, etc. depend on occurrence and behavior of arrival and departure queues. We study and investigate properties of weighted queues sum as a function of capacity allocation in the case of general Pareto curve. It results in straightforward and effective O(N2) algorithm giving integer solution for the problem of total weighted queues sum minimization over a time period with arbitrary number of considered time intervals. This integer problem has been solved earlier with the linear programming methods. However, the best complexity of such methods is O(N3.5L) and linear programming solvers based on them give a solution of the problem in a reasonable time for the limited number of considered intervals only. Furthermore, the algorithm developed in this paper constructs an "almost optimal" initial solution depending on the weight of corresponding queues. Significant feature of the initial solution is that it can be easily obtained by hand for an arbitrary number of considered intervals. It is also shown which intervals have to undergo reallocation of capacity in order to achieve an optimal flow. Moreover, the minimal finite solution set which contains an optimal flow for each weight value in the mentioned problem can be easily constructed. The developed algorithm finds optimal solutions in “interval-to-interval” techniques. The obtained solution method gives us the tool for controlling and managing of flow construction and queue outcome depending on strategies we follow. It gives an optimal solution of considered problem for the whole day with interval length from 5 to 15 minutes on standard PC in maximal 0.1 seconds.

Item URL in elib:https://elib.dlr.de/76468/
Document Type:Conference or Workshop Item (Speech, Paper)
Title:OPTIMIZATION OF RUNWAY CAPACITY UTILIZATION IN THE CASE OF GENERAL PARETO CURVE
Authors:
AuthorsInstitution or Email of AuthorsAuthors ORCID iD
Gluchshenko, OlgaOlga.Gluchshenko (at) dlr.deUNSPECIFIED
Date:2012
Refereed publication:Yes
Open Access:No
Gold Open Access:No
In SCOPUS:No
In ISI Web of Science:No
Page Range:pp. 1-17
Status:Published
Keywords:airport runway capacity, total weighted queues sum, Air Traffic Management
Event Title:ICAS 2012, 28th International Congress of the Aeronautical Sciences
Event Location:Brisbane, Australien
Event Type:international Conference
Event Dates:23.-28.09.2012
Organizer:ICAS Royal Aeronautical SocietyAustrailan Division
HGF - Research field:Aeronautics, Space and Transport
HGF - Program:Aeronautics
HGF - Program Themes:ATM and Operation (old)
DLR - Research area:Aeronautics
DLR - Program:L AO - Air Traffic Management and Operation
DLR - Research theme (Project):L - Efficient Flight Guidance (old)
Location: Braunschweig
Institutes and Institutions:Institute of Flight Control > Controller Assistance
Deposited By: Diederich, Kerstin
Deposited On:19 Jul 2012 13:11
Last Modified:02 Apr 2013 14:08

Repository Staff Only: item control page

Browse
Search
Help & Contact
Information
electronic library is running on EPrints 3.3.12
Copyright © 2008-2017 German Aerospace Center (DLR). All rights reserved.