Two-Stage Dynamic Programming in the Routing Problem with Decomposition

Abstract

Abstract: This paper considers an optimal movement routing problem with constraints. One such constraint is due to decomposing the original problem into a preliminary subproblem and a final subproblem; the tasks related to the preliminary problem must be executed before the tasks of the final subproblem begin. In particular, this condition may arise in the tool control problem for thermal cutting machines with computer numerical control (CNC): if there are long parts among workpieces, the cutting process near a narrow material boundary should start with these workpieces since such parts are subject to thermal deformations, which may potentially cause rejects. The problem statement under consideration involves two zones for part processing. The aggregate routing process in the original problem includes a starting point, a route (a permutation of indices), and a particular track consistent with the route and the starting point. Each of the subproblems has specific precedence conditions, and the travel cost functions forming the additive criterion may depend on the list of pending tasks. A special two-stage procedure is introduced to apply dynamic programming as a solution method. The structure of the optimal solution is established and an algorithm based on this structure is developed. The algorithm is implemented on a personal computer and a computational experiment is carried out. © 2023, Pleiades Publishing, Ltd.