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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Automation and remote control Jg. 84; H. 5; S. 543 - 563
Hauptverfasser:	Chentsov, A. G., Chentsov, P. A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Moscow Pleiades Publishing 01.05.2023 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!