Geodesic
On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 26 (2020) no. 3, pp. 219-234

Voir la notice de l'article provenant de la source Math-Net.Ru

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 a nuclear power plant.
Keywords: dynamic programming, Bellman function.
Mots-clés : route 
@article{TIMM_2020_26_3_a18,
     author = {A. G. Chentsov and A. A. Chentsov and A. N. Sesekin},
     title = {On the {Problem} of {Sequential} {Traversal} of {Megalopolises} with {Precedence} {Conditions} and {Cost} {Functions} {Depending} on a {List} of {Tasks}},
     journal = {Trudy Instituta matematiki i mehaniki},
     pages = {219--234},
     publisher = {mathdoc},
     volume = {26},
     number = {3},
     year = {2020},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMM_2020_26_3_a18/}
}
TY  - JOUR
AU  - A. G. Chentsov
AU  - A. A. Chentsov
AU  - A. N. Sesekin
TI  - On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks
JO  - Trudy Instituta matematiki i mehaniki
PY  - 2020
SP  - 219
EP  - 234
VL  - 26
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TIMM_2020_26_3_a18/
LA  - ru
ID  - TIMM_2020_26_3_a18
ER  - 
%0 Journal Article
%A A. G. Chentsov
%A A. A. Chentsov
%A A. N. Sesekin
%T On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks
%J Trudy Instituta matematiki i mehaniki
%D 2020
%P 219-234
%V 26
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TIMM_2020_26_3_a18/
%G ru
%F TIMM_2020_26_3_a18
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 Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 26 (2020) no. 3, pp. 219-234. http://geodesic.mathdoc.fr/item/TIMM_2020_26_3_a18/