RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
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., 2011, Volume 18, Number 3, Pages 101–124 (Mi mais190)  

This article is cited in 7 scientific papers (total in 7 papers)

Dynamic programming in a generalized courier problem with inner tasks: elements of a parallel structure

A. M. Grigoriev, E. E. Ivanko, A. G. Chentsov

Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg

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

Keywords: route, trace, precedence condition.

Full text: PDF file (677 kB)
References: PDF file   HTML file
UDC: 519.157
Received: 28.02.2011

Citation: A. M. Grigoriev, E. E. Ivanko, A. G. Chentsov, “Dynamic programming in a generalized courier problem with inner tasks: elements of a parallel structure”, Model. Anal. Inform. Sist., 18:3 (2011), 101–124

Citation in format AMSBIB
\Bibitem{GriIvaChe11}
\by A.~M.~Grigoriev, E.~E.~Ivanko, A.~G.~Chentsov
\paper Dynamic programming in a generalized courier problem with inner tasks: elements of a parallel structure
\jour Model. Anal. Inform. Sist.
\yr 2011
\vol 18
\issue 3
\pages 101--124
\mathnet{http://mi.mathnet.ru/mais190}


Linking options:
  • http://mi.mathnet.ru/eng/mais190
  • http://mi.mathnet.ru/eng/mais/v18/i3/p101

    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, P. A. Chentsov, “Ob odnoi nestatsionarnoi zadache marshrutizatsii s ogranicheniyami”, Model. i analiz inform. sistem, 19:4 (2012), 5–24  mathnet
    2. Grigorev A.M., Ivanko E.E., Knyazev S.T., Chentsov A.G., “Dinamicheskoe programmirovanie v obobschennoi zadache kurera, oslozhnennoi vnutrennimi rabotami”, Mekhatronika, avtomatizatsiya, upravlenie, 2012, no. 7, 14–21  elib
    3. Chentsov A.G., Chentsov P.A., “Marshrutizatsiya peremeschenii s ogranicheniyami i nestatsionarnymi funktsiyami stoimosti”, Nauchno-tekhnicheskie vedomosti sankt-peterburgskogo gosudarstvennogo politekhnicheskogo universiteta. informatika. telekommunikatsii. upravlenie, 4:152 (2012), 88–93  elib
    4. E. E. Ivanko, “Usechennyi metod dinamicheskogo programmirovaniya v zamknutoi zadache kommivoyazhera s simmetrichnoi funktsiei stoimosti”, Tr. IMM UrO RAN, 19, no. 1, 2013, 121–129  mathnet  mathscinet  elib
    5. A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Elements of dynamic programming in extremal route problems”, Autom. Remote Control, 75:3 (2014), 537–550  mathnet  crossref  isi
    6. Chentsov A.G., Chentsov A.A., “Dynamic Programming in the Routing Problem with Constraints and Costs Depending on a List of Tasks”, Dokl. Math., 88:3 (2013), 637–640  crossref  mathscinet  zmath  isi  elib  scopus
    7. Ya. V. Salii, “Vliyanie uslovii predshestvovaniya na vychislitelnuyu slozhnost resheniya marshrutnykh zadach metodom dinamicheskogo programmirovaniya”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2014, no. 1, 76–86  mathnet
  • Моделирование и анализ информационных систем
    Number of views:
    This page:312
    Full text:104
    References:54

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