This article is cited in 2 scientific papers (total in 2 papers)
On a Nonstationary Route Problem with Constraints
A. G. Chentsov, P. A. Chentsov
Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
The extremal route problem of permutations under constraints in the form of preceding conditions is investigated. It is supposed that an executer leaves the initial point (the base) after which he visits a system of megalopolises (finite goal sets) and performs some work on each megalopolis. The cost functions for executor permutations and interior works depend on the “visiting moment” that can correspond to the real time or can also correspond to the natural regular succession (the first visiting, the second visiting, and so on). An economic variant of the widely interpreted dynamic programming method (DPM) is constructed. On this basis an optimal computer realized algorithm is constructed. A variant of a greed algorithm is proposed.
route, trace, dynamic programming, preceding conditions.
PDF file (556 kB)
A. G. Chentsov, P. A. Chentsov, “On a Nonstationary Route Problem with Constraints”, Model. Anal. Inform. Sist., 19:4 (2012), 5–24
Citation in format AMSBIB
\by A.~G.~Chentsov, P.~A.~Chentsov
\paper On a Nonstationary Route Problem with Constraints
\jour Model. Anal. Inform. Sist.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
A. G. Chentsov, “K voprosu o marshrutizatsii kompleksov rabot”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2013, no. 1, 59–82
A. G. Chentsov, “Problem of successive megalopolis traversal with the precedence conditions”, Autom. Remote Control, 75:4 (2014), 728–744
|Number of views:|