Two-Stage Dynamic Programming in the Routing Problem with Decomposition

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Automation and remote control Ročník 84; číslo 5; s. 543 - 563
Hlavní autoři: Chentsov, A. G., Chentsov, P. A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Moscow Pleiades Publishing 01.05.2023
Springer Nature B.V
Témata:
Algorithms
CAE) and Design
Calculus of Variations and Optimal Control; Optimization
Computer-Aided Engineering (CAD
Constraints
Control
Cost function
Cutting equipment
Decomposition
Dynamic programming
Mathematical functions
Mathematics
Mathematics and Statistics
Mechanical Engineering
Mechatronics
Numerical controls
Operations Research
Optimization
Permutations
Personal computers
Robotics
Set theory
System Analysis
Systems Theory
Traveling salesman problem
Workpieces
dynamic programming
route
precedence conditions
megalopolis
ISSN:0005-1179, 1608-3032
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0005-1179
1608-3032
DOI:10.1134/S0005117923050053