Phase Transitions in the Reduction of the Traveling Salesman Problem and the Two-Level Cooperative Assignment Problem

Abstract

The paper considers algorithms for reducing the NP-hard traveling salesman problem to a two-level cooperative assignment problem and vice versa. The accuracy of the information of both algorithms is demonstrated by an example. Using the known conditions of the phase transition in the traveling salesman problem, copies of the problem were created, on which a computational experiment was subsequently carried out. The experiment is aimed at demonstrating the conservation of the phase transition when reducing one problem to another.