Abstract:
The paper considers domain-specific problems of the aviation industry, various routing problems, the assignment problem, parametric problems, for example, the problem of drawing up a production request and solving these problems using modifications of the ant colony method. An approach to formalizing the ant colony method by dividing the probability calculation function into layers of factors or terms is proposed. Modifications of the algorithm for solving routing problems for unmanned aerial vehicles and light aviation are proposed, including taking into account dynamic changes in route parameters, the possibility of flights in a heterogeneous environment, simultaneous routing of several aircraft and determining the best basing locations.