On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
A. G. Chentsovab, A. A. Chentsova, A. N. Sesekinba
a Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
b Ural Federal University named after the First President of Russia B. N. Yeltsin, Ekaterinburg
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 studying the engineering problem of dismantling radiation hazardous elements, where, in the framework of a problem statement traditional for discrete optimization, it takes an unacceptably long time to construct a cost matrix whose entries characterize the radiation doses received by performers at the stage of displacement and dismantling. It is assumed that, at the stage of the computational implementation of 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 an NPP.
dynamic programming, route, Bellman function.
|Russian Foundation for Basic Research
|This work was supported by the Russian Foundation for Basic Research (project no. 19-01-00573) and is a part of the research carried out at the Ural Mathematical Center.
PDF file (347 kB)
First page: PDF file
MSC: 05A05, 97N70, 97N80
A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks”, Trudy Inst. Mat. i Mekh. UrO RAN, 26, no. 3, 2020, 219–234
Citation in format AMSBIB
\by A.~G.~Chentsov, A.~A.~Chentsov, A.~N.~Sesekin
\paper On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
\serial Trudy Inst. Mat. i Mekh. UrO RAN
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|