RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Model. Anal. Inform. Sist., 2012, Volume 19, Number 4, Pages 5–24 (Mi mais245)  

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

Abstract: 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.

Keywords: route, trace, dynamic programming, preceding conditions.

Full text: PDF file (556 kB)
References: PDF file   HTML file

Document Type: Article
UDC: 519.6
Received: 04.03.2012

Citation: 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
\Bibitem{CheChe12}
\by A.~G.~Chentsov, P.~A.~Chentsov
\paper On a Nonstationary Route Problem with Constraints
\jour Model. Anal. Inform. Sist.
\yr 2012
\vol 19
\issue 4
\pages 5--24
\mathnet{http://mi.mathnet.ru/mais245}


Linking options:
  • http://mi.mathnet.ru/eng/mais245
  • http://mi.mathnet.ru/eng/mais/v19/i4/p5

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. G. Chentsov, “K voprosu o marshrutizatsii kompleksov rabot”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2013, no. 1, 59–82  mathnet
    2. A. G. Chentsov, “Problem of successive megalopolis traversal with the precedence conditions”, Autom. Remote Control, 75:4 (2014), 728–744  mathnet  crossref  isi
  • Number of views:
    This page:135
    Full text:51
    References:26

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019