Search

We consider the NP-hard problem of optimizing the sequence and times of aircraft landings under necessary constraints. It is impossible to obtain an exact solution of the problem online owing to the large amount of calculations. An integrated approach is proposed to produce an approximate solution: a genetic algorithm is applied at the first stage to obtain an initial solution; this algorithm is then improved based on a heuristic algorithm. The approach proposed permits obtaining optimal or nearly optimal solutions in reasonable time. To study the algorithms developed, a simulation software tool was used. Extensive computational experiments have confirmed the efficiency of the approach. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

It is noted that the aircraft landing problem is one of the main tasks in the planning and regulation of air traffic flows, which requires the use of a sufficiently serious mathematical apparatus. A brief overview of the main approaches to the formulation and solution of this problem is presented. [ABSTRACT FROM AUTHOR]