Methods of extremal routing and their application to the control of sheet cutting on CNC machines

Abstract

An extremal routing problem with constraints and complicated cost functions is considered. The investigated setting is oriented to application in engineering problems connected with sheet cutting on the machines with CNC. Nonstandard variant of dynamic programming is used for construction of an optimal solution including the starting point, the route (index permutation), and a concrete trajectory of the process. This procedure is implemented in the form of standard programs for a PC and a supercomputer. © 2019 Author(s).