This paper proposes a new approach to tacking problems of preflight and operational planning of UAV group actions. In contrast to the accepted cases in practice, this paper deals with the maintenance processes of a special class of dynamic objects, whose schedules require prior assignment in order to serve these objects "at the right time and in the right place". The goal of this work is to achieve the maximum effectiveness of group actions of unmanned aerial vehicles in a single flight, in order to find the separating parts of launch vehicles in the territory with the maximum speed. The main difference between the problem being solved and the known problem of a traveling salesman is the consideration of the required service schedule. The essence of the proposed approach is that the entire planned route is divided into several sections, the boundaries of which are dynamic objects that need to be served in the specified schedule. In each of these sections, one or two particular criteria are dominant - either timeliness is important, or cost-effectiveness, etc.the Developed software-algorithmic planning automation device allows increasing the efficiency of measures to detect separating parts of launch vehicles using a group of unmanned aerial vehicles. Consequently, of computer modeling, it turned out that a successful combination of individual sections of routes with each other by crossing and mutation, when each of the sections is formed using its own private two-parameter criterion, provides an increase in planning efficiency by 10-15% compared to known heuristic algorithms.