skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: On one modification of traveling salesman problem oriented on application in atomic engineering

Journal Article · · AIP Conference Proceedings
DOI:https://doi.org/10.1063/1.3515586· OSTI ID:21428693
;  [1]; ;  [2]
  1. Institute of Mathematics and Mechanics, Ural Division of Russian Academy of Sciences, 16 S. Kovalevskaya, Ekaterinburg, 620990 (Russian Federation)
  2. Ural Federal University named after the first President of Russia B.N.Yeltsin, 19 S. Mira, Ekaterinburg, 620002 (Russian Federation)

The mathematical model of a problem of minimization of a dose of an irradiation of the personnel which is carrying out dismantling of the completing block of a nuclear power plant is considered. Dismantling of elements of the block is carried out consistently. A brigade of workers having carried out dismantling of the next element of the block passes to similar work on other element of the block. Thus it is supposed that on the sequence of performance of works restrictions are imposed. These restrictions assume that on a number of pairs of works the condition is imposed: the second work cannot be executed before the first. This problem is similar to a known traveling salesman problem with the difference that expenses function depends on the list of outstanding works, and on sequence of performance of works and corresponding motions the constraints in the form of antecedence are imposed. The variant of the dynamic programming method is developed for such problem and the corresponding software is created.

OSTI ID:
21428693
Journal Information:
AIP Conference Proceedings, Vol. 1293, Issue 1; Conference: 36. international conference on applications of mathematics in engineering and economics, Sozopol (Bulgaria), 5-10 Jun 2010; Other Information: DOI: 10.1063/1.3515586; (c) 2010 American Institute of Physics; ISSN 0094-243X
Country of Publication:
United States
Language:
English