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



Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki:
Year:
Volume:
Issue:
Page:
Find






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


Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2013, Issue 1, Pages 59–82 (Mi vuu364)  

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

MATHEMATICS

To question of routing of works complexes

A. G. Chentsov

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

Abstract: The complicated variant of the problem of sequential megalopolis circuit with constraints in the form of preceding conditions is considered. The additional constraints on the junction character for fragments of exterior permutations and interior works (with respect to megalopolis) are imposed upon. It is supposed that costs of exterior permutations and interior works depend on the task list explicitly. The procedure of the dynamic programming type and (on their base) algorithm on the functional level are constructed.

Keywords: route, dynamic programming, preceding conditions.

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

Document Type: Article
UDC: 519.6
MSC: 28A33
Received: 11.02.2013

Citation: A. G. Chentsov, “To question of routing of works complexes”, Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2013, no. 1, 59–82

Citation in format AMSBIB
\Bibitem{Che13}
\by A.~G.~Chentsov
\paper To question of routing of works complexes
\jour Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki
\yr 2013
\issue 1
\pages 59--82
\mathnet{http://mi.mathnet.ru/vuu364}


Linking options:
  • http://mi.mathnet.ru/eng/vuu364
  • http://mi.mathnet.ru/eng/vuu/y2013/i1/p59

    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. A. Petunin, A. G. Chentsov, P. A. Chentsov, “Lokalnye vstavki na osnove dinamicheskogo programmirovaniya v zadache marshrutizatsii s ogranicheniyami”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2014, no. 2, 56–75  mathnet
    2. A. G. Chentsov, “Bellmanovskie vstavki v zadache marshrutizatsii s ogranicheniyami i uslozhnennymi funktsiyami stoimosti”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2014, no. 4, 122–141  mathnet
    3. A. G. Chentsov, Ya. V. Salii, “A model of “nonadditive” routing problem where the costs depend on the set of pending tasks”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 8:1 (2015), 24–45  mathnet  crossref  elib
    4. A. G. Chentsov, M. Yu. Khachai, M. Yu. Khachai, “An exact algorithm with linear complexity for a problem of visiting megalopolises”, Proc. Steklov Inst. Math. (Suppl.), 295, suppl. 1 (2016), 38–46  mathnet  crossref  mathscinet  isi  elib
    5. M. S. Kosheleva, A. A. Chentsov, A. G. Chentsov, “O zadache marshrutizatsii s ogranicheniyami, vklyuchayuschimi zavisimost ot spiska zadanii”, Tr. IMM UrO RAN, 21, no. 4, 2015, 178–195  mathnet  mathscinet  elib
    6. Chentsov A.G., Chentsov A.A., “Route Problem With Constraints Depending on a List of Tasks”, Dokl. Math., 92:3 (2015), 685–688  crossref  zmath  isi  elib  scopus
    7. A. A. Petunin, A. G. Chentsov, P. A. Chentsov, “Ob odnoi zadache marshrutizatsii peremeschenii instrumenta pri listovoi rezke detalei”, Model. i analiz inform. sistem, 22:2 (2015), 278–294  mathnet  mathscinet  elib
    8. A. A. Chentsov, A. G. Chentsov, “Obobschennaya model kurera s dopolnitelnymi ogranicheniyami”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 9:1 (2016), 46–58  mathnet  crossref  elib
    9. A. G. Chentsov, A. A. Chentsov, “Marshrutizatsiya peremeschenii pri dinamicheskikh ogranicheniyakh: zadacha “na uzkie mesta””, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 26:1 (2016), 121–140  mathnet  crossref  mathscinet  elib
    10. A. G. Chentsov, A. A. Chentsov, “Zadacha marshrutizatsii, oslozhnennaya zavisimostyu funktsii stoimosti i “tekuschikh” ogranichenii ot spiska zadanii”, Model. i analiz inform. sistem, 23:2 (2016), 211–227  mathnet  crossref  mathscinet  elib
    11. A. G. Chentsov, “Optimiziruyuschie vstavki v zadachakh marshrutizatsii i ikh realizatsiya na osnove dinamicheskogo programmirovaniya”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 26:4 (2016), 565–578  mathnet  crossref  mathscinet  elib
    12. A. G. Chentsov, P. A. Chentsov, “Routing under constraints: problem of visit to megalopolises”, Autom. Remote Control, 77:11 (2016), 1957–1974  mathnet  crossref  isi  elib  elib
    13. A. G. Chentsov, A. M. Grigoryev, “A scheme of independent calculations in a precedence constrained routing problem”, Discrete Optimization and Operations Research (DOOR 2016), Lecture Notes in Computer Science, 9869, eds. Y. Kochetov, M. Khachay, V. Beresnev, E. Nurminski, P. Pardalos, Springer, Cham, 2016, 121–135  crossref  mathscinet  zmath  isi  scopus
    14. A. A. Petunin, A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints”, Autom. Remote Control, 78:4 (2017), 666–681  mathnet  crossref  isi  elib
    15. A. G. Chentsov, A. A. Chentsov, A. M. Grigorev, “Ob odnoi zadache marshrutizatsii, modeliruyuschei peremescheniya v radiatsionnykh polyakh”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 27:4 (2017), 540–557  mathnet  crossref  elib
    16. A. G. Chentsov, A. M. Grigoryev, A. A. Chentsov, “Solving a routing problem with the aid of an independent computations scheme”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 11:1 (2018), 60–74  mathnet  crossref  elib
    17. A. G. Chentsov, P. A. Chentsov, “Optimizatsiya tochki starta v zadache posledovatelnogo obkhoda megapolisov pri nalichii uslovii predshestvovaniya”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 11:2 (2018), 83–95  mathnet  crossref
    18. A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “Dinamicheskoe programmirovanie v obobschennoi zadache «na uzkie mesta» i optimizatsiya tochki starta”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 28:3 (2018), 348–363  mathnet  crossref
  • Вестник Удмуртского университета. Математика. Механика. Компьютерные науки
    Number of views:
    This page:147
    Full text:30
    References:21
    First page:1

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