RUS  ENG
Full version
JOURNALS // Problemy Upravleniya // Archive

Probl. Upr., 2018 Issue 5, Pages 2–13 (Mi pu1096)

This article is cited in 17 papers

Reviews

Methods for solving of the aircraft landing problem. P. 2. Approximate solution methods

G. S. Veresnikov, N. A. Egorov, E. L. Kulida, V. G. Lebedev

V. A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences, Moscow

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.

Keywords: optimal queue for landing, objective function, genetic algorithms, global and local optimization, memetic algorithms.

UDC: 519.85+656.7

DOI: 10.25728/pu.2018.5.1


 English version:
Control Sciences, 2019, 80:8, 1502–1518


© Steklov Math. Inst. of RAS, 2024