RUS  ENG
Full version
JOURNALS // Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta // Archive

Izv. IMI UdGU, 2021 Volume 58, Pages 94–126 (Mi iimi423)

This article is cited in 3 papers

MATHEMATICS

One task of routing jobs in high radiation conditions

A. G. Chentsovab, A. A. Chentsova, A. N. Sesekinba

a N. N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620108, Russia
b Ural Federal University, ul. Mira, 19, Yekaterinburg, 620002, Russia

Abstract: The problem of sequential bypass of megalopolises is investigated, focused on the problem of dismantling a system of radiation hazardous objects under constraints in the form of precedence conditions. The radiation impact on the performers is assessed by the doses received during movements and during the performance of dismantling works. The route problem of minimizing the dose load of workers carrying out dismantling in one or another sequence of operations is considered. The procedure for constructing an optimal solution using a variant of dynamic programming is investigated. On this basis, an algorithm is built, implemented on a PC. Examples of the numerical solution of a model problem for the minimum dose load are given.

Keywords: dynamic programming, dismantling, route.

UDC: 517.958, 530.145.6

MSC: 49L20, 90C39

Received: 05.07.2021

DOI: 10.35634/2226-3594-2021-58-06



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025