Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс: http://elar.urfu.ru/handle/10995/131173
Название: Reducing the Exposure Dose by Optimizing the Route of Personnel Movement When Visiting Specified Points and Taking into Account the Avoidance of Obstacles
Авторы: Tashlykov, O. L.
Grigoryev, A. M.
Kropachev, Y. A.
Дата публикации: 2022
Издатель: MDPI
Библиографическое описание: Tashlykov, OL, Grigoryev, AM & Kropachev, YA 2022, 'Reducing the Exposure Dose by Optimizing the Route of Personnel Movement When Visiting Specified Points and Taking into Account the Avoidance of Obstacles', Energies, Том. 15, № 21, 8222. https://doi.org/10.3390/en15218222
Tashlykov, O. L., Grigoryev, A. M., & Kropachev, Y. A. (2022). Reducing the Exposure Dose by Optimizing the Route of Personnel Movement When Visiting Specified Points and Taking into Account the Avoidance of Obstacles. Energies, 15(21), [8222]. https://doi.org/10.3390/en15218222
Аннотация: The data on the collective dose reduction of a nuclear power plant’s personnel after the introduction of new dose limits by the International Commission for Radiological Protection (ICRP) (Publication 60) in 1990 are presented. The main methods of personnel irradiation reduction are formulated, which are namely: to impact on radiation parameters, to increase the distance between a radiation source and a person, and to reduce the exposure time in radiation fields. The ways to implement one of the basic principles of radiation safety, the principle of optimization, are described. The possibility of route optimization in minimizing the personnel dose costs when moving in heterogeneous radiation fields is shown. The results of the algorithm development for solving the “dosimetrist problem” using the Dijkstra algorithm and dynamic programming are presented, including determining the optimal route with visiting given points in the room and bypassing possible obstacles. An interpolation algorithm based on the method of radial basic functions for constructing a radiation map of a room is proposed and implemented. The results of a computational experiment using the “Uran” supercomputer and the assessment of the developed algorithm efficiency are given. The results of experimental verification of the developed algorithm for solving the “dosimetrist problem” using interpolation in the operating nuclear power plant conditions are presented. © 2022 by the authors.
Ключевые слова: DIJKSTRA ALGORITHM
DYNAMIC PROGRAMMING
OPTIMAL ROUTE
OPTIMIZATION OF RADIATION PROTECTION
RADIAL BASIS FUNCTIONS
RADIATION DOSE
RADIATION MAP OF THE ROOM
ROUTE OPTIMIZATION
TASK OF THE DOSIMETRIST
DYNAMIC PROGRAMMING
ENERGY EFFICIENCY
INTERPOLATION
NUCLEAR ENERGY
NUCLEAR FUELS
NUCLEAR POWER PLANTS
RADIAL BASIS FUNCTION NETWORKS
RADIATION
SUPERCOMPUTERS
BASE FUNCTION
DIJKSTRA'S ALGORITHMS
OPTIMAL ROUTES
OPTIMIZATION OF RADIATION PROTECTION
RADIAL BASE FUNCTION
RADIAL BASIS
RADIATION MAP OF THE ROOM
RADIATION MAPS
ROUTE OPTIMIZATION
TASK OF THE DOSIMETRIST
COMPUTATIONAL EFFICIENCY
URI: http://elar.urfu.ru/handle/10995/131173
Условия доступа: info:eu-repo/semantics/openAccess
cc-by
Текст лицензии: https://creativecommons.org/licenses/by/4.0/
Идентификатор SCOPUS: 85141864512
Идентификатор WOS: 000883483300001
Идентификатор PURE: 31785751
0e028538-cd99-4a67-ae80-29b7f9064ac8
ISSN: 1996-1073
DOI: 10.3390/en15218222
Располагается в коллекциях:Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Файлы этого ресурса:
Файл Описание РазмерФормат 
2-s2.0-85141864512.pdf4,51 MBAdobe PDFПросмотреть/Открыть


Лицензия на ресурс: Лицензия Creative Commons Creative Commons