Methods for Solving of the Aircraft Landing Problem. II. Approximate Solution Methods

Methods are considered of an approximate solution of the static problem of forming the optimal aircraft queue for landing, which do not guarantee an accurate solution but provide an opportunity to obtain an acceptable solution that meets the requirements. It is noted that typically they are a synthe...

Full description

Saved in:
Bibliographic Details
Published in:Automation and remote control 2019-08, Vol.80 (8), p.1502-1518
Main Authors: Veresnikov, G. S., Egorov, N. A., Kulida, E. L., Lebedev, V. G.
Format: Article
Language:English
Subjects:
Aircraft
Aircraft landing
Approximation
CAE) and Design
Calculus of Variations and Optimal Control
Optimization
Computer-Aided Engineering (CAD
Control
Control Sciences
Global optimization
Heuristic methods
Mathematics
Mathematics and Statistics
Mechanical Engineering
Mechatronics
Queues
Robotics
Systems Theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Methods are considered of an approximate solution of the static problem of forming the optimal aircraft queue for landing, which do not guarantee an accurate solution but provide an opportunity to obtain an acceptable solution that meets the requirements. It is noted that typically they are a synthesis of a meta-heuristic method of global optimization to obtain the landing sequence of aircraft and a local exact method to find the optimal solution for the sequences obtained. The brief overview of some of them is presented.
ISSN:0005-1179
1608-3032
DOI:10.1134/S0005117919080101