Iteration method in the routing problem with internal losses

The problem of a sequential traversal of sets is considered, which is complicated by the necessity of fulfilling (internal) tasks on the sets as well as by restrictions in the form of precedence conditions. It is assumed that the method of aggregating the losses is additive. For the appearing extremal problem with dependent variables, an equivalent transformation is built for the optimization problem on a Cartesian product. Based on this, an iteration method is constructed that uses a reconstructible model of the courier problem (a traveling salesman problem complicated by precedence conditions).