Abstract
We establish the importance of optimizing the route with the aim of minimizing staff exposure to radiation during activities in nonstationary radiation fields. We consider a routing problem with side constraints, including precedence constraints, and complicated travel cost functions. The travel cost function (nominated in radiation dose units) computations account for the need to bypass the obstacles, which provides for modeling real-life movements in the situations that arise, for example, during recovery procedures following radiation-related emergencies in nuclear facilities. During normal operation, such route optimization is of use for activities such as radiation parameters monitoring in different locations inside a nuclear facility by dosimetry specialists. In this paper, we describe our approach to solving this problem through a parallel algorithm implemented for the Uran supercomputer.

This publication has 1 reference indexed in Scilit: