On redistribution of targets between interceptors in moving targets traveling salesman problem

The paper considers a moving target traveling salesman problem (MTTSP) with rectilinearly and uniformly moving targets. Parameters of the targets’ law of motion such as initial positions, velocities and motion directions considered to be known. Within the framework of the general formulation, a private subtask is considered – task on the redistribution of targets between two traveling salesmen (interceptors). Time criterion is used as an optimization criterion. Time criterion here is maximum operating time of two interceptors. Assuming that the optimal plan for bypassing targets for one interceptor is known, the task is to find the optimal plan for each of the two with a given initial target configuration. Thus, the under study problem differs from the general MTTSP in having some additional information. For considered problem two algorithms for redistributing targets are proposed, statistical analysis of both of them is carried out and the results of their work are presented. The first one is more precise but is slower. The second one is faster because of less precision.