?
Построение алгоритмов поиска и устранения дефектов пассажирских воздушных судов гражданской авиации
The relevance of this work is due to the fact, that reducing the time of searching and the time for eliminating defects in civil aviation passenger aircraft can significantly reduce departure delays and the associated losses of airlines. The analysis of statistical data shows that the searching and eliminating defects are the dominant causes of delays in civil aviation aircraft. At the same time, 90% of the time falls on the search for defects. Modern aircraft are equipped with on-board diagnostic systems. Their main purpose is to control the technical state of the plane. They report if there a malfunction. However, in most cases, they do not allow to determine a localization of a malfunction with an accuracy to the defect that have caused it. The manual methods for conducting inspections that use specially designed hardware and software are needed in that case. The searching time depends on how well the algorithm for performing checks is chosen. This time can be reduced by providing the technical staff with pre-created algorithms for finding and eliminating defects. A significant effect will be achieved if and only if these algorithms are optimal according to a criterion that reflects the real dependence of losses from the delay time. As statistics show that losses grow exponentially with the increase in time spent on manual search and elimination of a defect that is the cause of a malfunction recorded by on-board monitoring systems. Because the objective function is not additive, classical methods are not applicable for finding the desired algorithm. Heuristic methods do not guarantee the construction of an optimal algorithm. Finding it by brute force search is not realistic, due to the huge number of possible variants. The purpose of the article is to propose a computationally efficient method for constructing optimal algorithms for finding and eliminating defects, considering the exponential dependence of losses from the time of finding and eliminating a defect. The algorithm considered to be optimal if the average losses caused by the flight delay are minimal. The method for constructing the desired algorithms based on the Bellman optimality principle proposed in this article for the first time. Previously, this approach was used only with a linear dependence of losses from time to search for defects. Note that each combination of indications of the on-board diagnostic system has its own set of defects, with an accuracy up to which the defect that is the cause of the malfunction is localized. The number of possible combinations of indications of the on-board diagnostic system is large. Each of them must have its own manual search algorithm. Naturally, the time of its construction should not be too long. The proposed method satisfies this requirement. The construction of an algorithm and its presentation to a specialist may well be carried out using a modern mobile device, which is not even necessarily to be a full-fledged PC. The materials of this article are of practical value for managers and employees of civil aviation passenger aircraft operation services.
Key words: civilian passenger aircraft, algorithms for the search and elimination defects, dynamic programming.