Operational planning of aircraft routes when servicing a random stream of requests arriving during the flight

Abstract

The process of sen*icing ground facilities with a group of aircraft is being considered when there is a flow of flight requests. The problem of parametric optimization is posed in the selection of the number of aircraft based on the multiplicative form of a single efficiency criterion. It is shown that the solution of this problem is possible with the help of the queuing theory, according to which the system under consideration belongs to the class of multi-channel queuing systems with waiting. The inventive method for developing an operational planning algorithm is based on a combination of sequentially executed ranking operations in order to ensure the lowest operational costs based on a minimax criterion in the worst conditions in terms of service delay time. A simulation program has been developed that provides an analysis of various dispatching algorithms, as well as determining at each step the number of free requests and the number of available and occupied aircraft. Along with the choice of the most effective algorithm for operational planning of aircraft routes, the task of assigning the required number of aircraft is solved.