Aircraft Group Coordinated Flight Route Optimization Using Branch-and-Bound Procedure in Resolving the Problem of Environmental Monitoring

Abstract

The solution of a travelling salesman problem (TSP) for the case of two-dimensional flight routing is suggested. Unlike the case of one-dimensional routing, this solution implies the formation of two initial matriсes of the distances between the points for two unlinked routes. The routes are analyzed alternately with the coordinated selection of the minimal length element in each of them. Examples of calculations demonstrating the proposed approach efficiency are provided indicating the reduction of overflights by more than two times.