Dynamic Programming in Routing Problems (Nuclear power, Engineering)

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.