Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/103152
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChentsov, A. G.en
dc.contributor.authorChentsov, P. A.en
dc.date.accessioned2021-08-31T15:07:53Z-
dc.date.available2021-08-31T15:07:53Z-
dc.date.issued2020-
dc.identifier.citationChentsov A. G. On routing problem with starting point optimization / A. G. Chentsov, P. A. Chentsov. — DOI 10.15826/UMJ.2020.2.005 // Ural Mathematical Journal. — 2020. — Vol. 6. — Iss. 2. — P. 44-62.en
dc.identifier.issn24143952-
dc.identifier.otherFinal2
dc.identifier.otherAll Open Access, Gold3
dc.identifier.otherhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85099594771&doi=10.15826%2fUMJ.2020.2.005&partnerID=40&md5=57581ace9ef26177d28c6776c268ad3a
dc.identifier.otherhttps://umjuran.ru/index.php/umj/article/download/264/pdfm
dc.identifier.urihttp://hdl.handle.net/10995/103152-
dc.description.abstractOne problem focused on engineering applications is considered. It is assumed that sequential visits to megacities have been implemented. After all visits have been made, it is required to return to the starting point (a more complex dependence on the starting point is also considered). But the last requirement is not strict: some weakening of the return condition is acceptable. Under these assumptions, it is required to optimize the choice of starting point, route, and specific trajectory. The well-known dynamic programming (DP) is used for the solution. But when using DP, significant difficulties arise associated with the dependence of the terminal component of the criterion on the starting point. Starting point enumeration is required. We consider the possibility of reducing the enumeration associated with applied variants of universal (relative to the starting point) dynamic programming. Of course, this approach requires some transformation of the problem. © 2020, Krasovskii Institute of Mathematics and Mechanics. All rights reserved.en
dc.description.sponsorshipThis work was supported by the Russian Foundation for Basic Research (Sections 1–4) and No. 18-07-00637 (Sections 5–7).en
dc.format.mimetypeapplication/pdfen
dc.language.isoenen
dc.publisherKrasovskii Institute of Mathematics and Mechanicsen
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.sourceUral Math. J.2
dc.sourceUral Mathematical Journalen
dc.subjectDYNAMIC PROGRAMMINGen
dc.subjectPRECEDENCE CONDITIONSen
dc.subjectROUTEen
dc.titleOn routing problem with starting point optimizationen
dc.typeArticleen
dc.typeinfo:eu-repo/semantics/articleen
dc.typeinfo:eu-repo/semantics/publishedVersionen
dc.identifier.doi10.15826/UMJ.2020.2.005-
dc.identifier.scopus85099594771-
local.contributor.employeeChentsov, A.G., Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, 16 S. Kovalevskaya Str, Ekaterinburg, 620108, Russian Federation, Ural Federal University, 19 Mira Str, Ekaterinburg, 620002, Russian Federation
local.contributor.employeeChentsov, P.A., Ural Federal University, 19 Mira Str, Ekaterinburg, 620002, Russian Federation
local.description.firstpage44-
local.description.lastpage62-
local.issue2-
local.volume6-
local.contributor.departmentKrasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, 16 S. Kovalevskaya Str, Ekaterinburg, 620108, Russian Federation
local.contributor.departmentUral Federal University, 19 Mira Str, Ekaterinburg, 620002, Russian Federation
local.identifier.pure20513321-
local.identifier.pure7a4bd3ea-64f7-4245-aa4d-6614c927f93fuuid
local.identifier.eid2-s2.0-85099594771-
local.fund.rffi18-07-00637-
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-85099594771.pdf598,04 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.