Multidimensional routing with the increased navigation accuracy with the maintenance of flight notifications of the flight vehicles

Abstract

The article covers the problem the multidimensional routing of flights for the transportation of cargo and mail, with the condition of the corresponding equipment presence for performing navigation of increased precision to obtain the possibility of the formation flights under any weather conditions. The given circumstances are capably essential to reduce load while using the airspace, which will make it possible to achieve transportation independent of its saturation. While planning the routes it is also necessary to consider the interests of different interested groups, which are often opposite to one another. In the view of the different directivity of the tasks in question, the solution can require the sorting as excessively as large, so the smaller quantity of possible situations (versions of the solution), the lower the level of the calculation of these versions is, and the greater their quantity is. The exact example of multidimensional routing, which is affected by the interests of operational nature and the interests of the urgency of the performance of the claims, expressed by weight coefficients, is depicted in this work. The only version in favour of the general production process, which is obtained with the help of a genetic algorithm, is a solution of this problem. It was necessary to introduce some designations and assumptions, the enumeration of which can be supplemented. Optimal solution can be obtained both by the enumeration of the solution versions and with the help of the genetic algorithm, which is allowed for a smaller number of iterations, to obtain suboptimal in real time, which corresponds to the conditions of the task solution. In that the example dynamic priorities are assigned, based on multiplicative form by expert evaluation, which form criteria for the ranking of request for each step of route planning. As a result, there are the exact versions of the solution, which correspond to the interests of different groups and the version, obtained with the help of a genetic algorithm, which satisfy the opposite interests of these groups. All versions of the solution are proved to be different, which indicates the need of applying the objective and substantiated apparatus for making the decision, which the genetic algorithm actually is. The proposed mathematical apparatus has prospects for implementation.