On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs

On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs

0.00 Avg rating0 Votes
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:
Keywords: vehicle routing & scheduling, programming: dynamic
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.