On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks

Abstract

A constrained routing problem with complicated cost functions is studied. The construction of the cost functions can be difficult,and therefore the stages of this construction are elements of the solution of the problem. This situation arises, in particular, in studyingthe engineering problem of dismantling radiation hazardous elements, where, in the framework of a problem statement traditional fordiscrete optimization, it takes an unacceptably long time to construct a cost matrix whose entries characterize the radiation dosesreceived by performers at the stage of displacement and dismantling. It is assumed that, at the stage of the computational implementationof the resulting optimal algorithm, the corresponding “parts” of the matrix may be not fed to the computer’s memory but calculated as needed.Possible applications of the developed methods may be related to the problem of dismantling a decommissioned generator unit of a nuclear power plant. © 2021, Pleiades Publishing, Ltd.