{"title":"One task of routing jobs in high radiation conditions","authors":"A. G. Chentsov, A. Chentsov, A. Sesekin","doi":"10.35634/2226-3594-2021-58-06","DOIUrl":null,"url":null,"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.","PeriodicalId":42053,"journal":{"name":"Izvestiya Instituta Matematiki i Informatiki-Udmurtskogo Gosudarstvennogo Universiteta","volume":"134 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Izvestiya Instituta Matematiki i Informatiki-Udmurtskogo Gosudarstvennogo Universiteta","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35634/2226-3594-2021-58-06","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
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.