Dynamic Programming in a Generalized Courier Problem with Inner Tasks: Elements of a Parallel Structure

In the article we concern the questions connected with the realization of a dynamic programming method in problems of consequent visiting of megapolises. The realization is complicated by precedence conditions and works inside the megapolises. The scheme for constructing a reduced (partial) array of...

Full description

Bibliographic Details
Main Authors: A. M. Grigoriev, E. E. Ivanko, A. G. Chentsov
Format: Article
Language:English
Published: Yaroslavl State University 2011-09-01
Series:Моделирование и анализ информационных систем
Subjects:
Online Access:https://www.mais-journal.ru/jour/article/view/1068
Description
Summary:In the article we concern the questions connected with the realization of a dynamic programming method in problems of consequent visiting of megapolises. The realization is complicated by precedence conditions and works inside the megapolises. The scheme for constructing a reduced (partial) array of Bellman function values using parallel computing without loss in accuracy is suggested. This procedure is realized on a multiprocessor computing system; parallelizing is performed at the stage of Bellman function layers construction.
ISSN:1818-1015
2313-5417