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žené v:

Podrobná bibliografia
Vydané v:	Automation and remote control Ročník 84; číslo 5; s. 543 - 563
Hlavní autori:	Chentsov, A. G., Chentsov, P. A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Moscow Pleiades Publishing 01.05.2023 Springer Nature B.V
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!