This article is cited in 23 papers

Two-level programming problems

Problem of successive megalopolis traversal with the precedence conditions

A. G. Chentsov

Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, Yekaterinburg, Russia

Abstract: Consideration was given to the problem of constrained routing including visits to a finite system of megalopolises and at that execution of one or another internal job. The costs of displacements and executed jobs may depend on the list of the not yet completed tasks. A variant of the method of dynamic programming doing without construction of the entire array of values of the Bellman function was proposed. Some variants of the heuristic algorithms were discussed. Possible applications may be related, in particular, with the problems of reducing irradiance of the personnel of the nuclear power plants and sheet article cutting on the numerically controlled machine tools.

Presented by the member of Editorial Board: A. I. Kibzun

Received: 14.11.2013

 English version: Automation and Remote Control, 2014, 75:4, 728–744

Bibliographic databases:

• 
•