RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






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


Avtomat. i Telemekh., 2014, Issue 4, Pages 170–190 (Mi at7539)  

This article is cited in 17 scientific papers (total in 17 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.

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

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

Bibliographic databases:

Presented by the member of Editorial Board: . . 

Received: 14.11.2013

Citation: A. G. Chentsov, “Problem of successive megalopolis traversal with the precedence conditions”, Avtomat. i Telemekh., 2014, no. 4, 170–190; Autom. Remote Control, 75:4 (2014), 728–744

Citation in format AMSBIB
\Bibitem{Che14}
\by A.~G.~Chentsov
\paper Problem of successive megalopolis traversal with the precedence conditions
\jour Avtomat. i Telemekh.
\yr 2014
\issue 4
\pages 170--190
\mathnet{http://mi.mathnet.ru/at7539}
\transl
\jour Autom. Remote Control
\yr 2014
\vol 75
\issue 4
\pages 728--744
\crossref{https://doi.org/10.1134/S0005117914040122}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000334423100012}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84899570656}


Linking options:
  • http://mi.mathnet.ru/eng/at7539
  • http://mi.mathnet.ru/eng/at/y2014/i4/p170

    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. 92, no. 3, 2015, 685–688  crossref  mathscinet  zmath  isi  scopus
    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, 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
    4. 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
    5. 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
    6. 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
    7. 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
    8. 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
    9. A. G. Chentsov, A. A. Chentsov, “A discrete-continuous routing problem with precedence conditions”, Proc. Steklov Inst. Math. (Suppl.), 300, suppl. 1 (2018), 56–71  mathnet  crossref  crossref  isi  elib
    10. 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
    11. A. G. Chentsov, A. A. Chentsov, “Modelnyi variant zadachi o posledovatelnoi utilizatsii istochnikov izlucheniya (iteratsii na osnove optimiziruyuschikh vstavok)”, Izv. IMI UdGU, 50 (2017), 83–109  mathnet  crossref  elib
    12. V. V. Zakharov, A. V. Mugaiskikh, “Dinamicheskaya adaptatsiya geneticheskogo algoritma marshrutizatsii transporta na bolshikh setyakh”, UBS, 73 (2018), 108–133  mathnet  crossref  elib
    13. A. G. Chentsov, P. A. Chentsov, A. A. Petunin, A. N. Sesekin, “Model of megalopolises in the tool path optimisation for CNC plate cutting machines”, Int. J. Prod. Res., 56:14 (2018), 4819–4830  crossref  isi  scopus
    14. A. G. Chentsov, A. M. Grigorev, “Optimiziruyuschie multivstavki v zadachakh marshrutizatsii s ogranicheniyami”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 28:4 (2018), 513–530  mathnet  crossref  elib
    15. A. G. Chentsov, P. A. Chentsov, “Ob odnoi zadache marshrutizatsii s optimizatsiei tochki starta–finisha”, Izv. IMI UdGU, 52 (2018), 103–115  mathnet  crossref  elib
    16. Petunin A.A. Chentsov A.G. Chentsov P.A., “Optimizing Insertions in a Constraint Routing Problem With Complicated Cost Functions”, J. Comput. Syst. Sci. Int., 58:1 (2019), 113–125  crossref  isi  scopus
    17. A. G. Chentsov, P. A. Chentsov, “The routing problems with optimization of the starting point: dynamic programming”, Izv. IMI UdGU, 54 (2019), 102–121  mathnet  crossref  elib
  • Avtomatika i Telemekhanika
    Number of views:
    This page:253
    Full text:32
    References:50
    First page:39

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