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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

G. S. Veresnikov

Trapeznikov Institute of Control Sciences

Author for correspondence.
Email: veresnikov@mail.ru
Russian Federation, Moscow

N. A. Egorov

Trapeznikov Institute of Control Sciences

Author for correspondence.
Email: egorov@ipu.ru
Russian Federation, Moscow

E. L. Kulida

Trapeznikov Institute of Control Sciences

Author for correspondence.
Email: lenak@ipu.ru
Russian Federation, Moscow

V. G. Lebedev

Trapeznikov Institute of Control Sciences

Author for correspondence.
Email: lebedev@ipu.ru
Russian Federation, Moscow

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Pleiades Publishing, Inc.