Article ID: | iaor20123048 |
Volume: | 73 |
Issue: | 3 |
Start Page Number: | 532 |
End Page Number: | 546 |
Publication Date: | Mar 2012 |
Journal: | Automation and Remote Control |
Authors: | Chentsov A |
Keywords: | vehicle routing & scheduling, programming: dynamic |
Consideration was given to a scheme for solving the extremal routing problem constrained by the precedence conditions and based on a modification of the dynamic programming method. Attention was focused on an issue related with parallelization of the procedure of constructing the Bellman function layers. A hypothetical construction for distribution of the space of positions between the processors such that they can run without any data exchange until the final stage of computations was proposed.