Elements of dynamic programming in extremal routing problems

This paper considers the routing problem of visiting megalopolises, which is complicated by constraints in the form of the precedence conditions and jobs within megalopolises. By assumption, the cost functions may depend on the list of pending jobs. We demonstrate that the developed theory can be applied to the dismantlement problem of a decommissioned power-generating unit in a nuclear plant. In this problem, the cost of moving depends on the list of pending jobs, viz., any still mounted components of the equipment have emission. Finally, we show that the computational difficulty of the constructed algorithms requires involving parallel structure elements.