Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/102960
Title: Dynamic Programming in Routing Problems (Nuclear power, Engineering)
Authors: Chentsov, A. G.
Issue Date: 2020
Publisher: American Institute of Physics Inc.
Citation: Chentsov A. G. Dynamic Programming in Routing Problems (Nuclear power, Engineering) / A. G. Chentsov. — DOI 10.1063/5.0036656 // AIP Conference Proceedings. — 2020. — Vol. 2315. — 040011.
Abstract: In this investigation, extremal routing problems oriented to engineering applications are considered. These applications can be associated with dismantling of radioactive sources under accidents at nuclear power plants and with control of sheet cutting on CNC machines. Issues related to construction of optimal processes are investigated, including the choice of starting point, regular succession of tasks, and determination of concrete trajectories. To solve this problem, a nonstandard variant of dynamic programming is used. Precedence conditions play an important role in issues of reducing computational complexity. A theoretical procedure is implemented in the form of an algorithm and a standard program for a PC and a supercomputer. Model problems oriented to the above-mentioned engineering applications are resolved. © 2020 American Institute of Physics Inc.. All rights reserved.
URI: http://hdl.handle.net/10995/102960
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 85098663844
PURE ID: 20378099
15feeea8-2df5-4858-987a-2bf39fc47efe
ISSN: 0094243X
ISBN: 9780735440579
DOI: 10.1063/5.0036656
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-85098663844.pdf257,98 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.