Autor:	Elena L. Kulida, Nikolay A. Egorov, Valentin G. Lebedev
Rok vydání:	2018
Předmět:	Random search Sequence Computer science Mode (statistics) Quadratic programming Queue Approximate solution Algorithm Physics::Geophysics
Zdroj:	2018 Eleventh International Conference "Management of large-scale system development" (MLSD.
DOI:	10.1109/mlsd.2018.8551908
Popis:	This paper considers the heuristic algorithm for the approximate solution of the problem in real-time mode. The proposed algorithm consists of replacing the random search of all possible sequences of landings with a directed search. The Iinear/quadratic programming problem for a given landing sequence is solved to optimize the landing time of planes.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::2332eb0279cdb4fcbd8d17fd1960aa33 https://doi.org/10.1109/mlsd.2018.8551908 Zobrazit plný text záznamu