RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Ural Math. J.:
Year:
Volume:
Issue:
Page:
Find






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


Ural Math. J., 2018, Volume 4, Issue 2, Pages 43–55 (Mi umj62)  

Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions

Alexander G. Chentsov, Alexey M. Grigoriev, Alexey A. Chentsov

Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, 16 S. Kovalevskaya str., Ekaterinburg, Russia, 620990

Abstract: We study the optimization of the initial state, route (a permutation of indices), and track in an extremal problem connected with visiting a finite system of megalopolises subject to precedence constraints where the travel cost functions may depend on the set of (pending) tasks. This problem statement is exemplified by the task to dismantle a system of radiating elements in case of emergency, such as the Chernobyl or Fukushima nuclear disasters. We propose a solution based on a parallel algorithm, which was implemented on the Uran supercomputer. It consists of a two-stage procedure: stage one determines the value (extremum) function over the set of all possible initial states and finds its minimum and also the point where it is achieved. This point is viewed as a base of the optimal process, which is constructed at stage two. Thus, optimization of the starting point for the route through megalopolises, connected with conducting certain internal tasks there, is an important element of the solution. To this end, we employ the apparatus of the broadly understood dynamic programming with elements of parallel structure during the construction of Bellman function layers.

Keywords: Dynamic programming, Route, Sequencing, Precedence constraints, Parallel computation.

Funding Agency Grant Number
Russian Science Foundation 14-11-00109
This work was supported by Russian Science Foundation (project no. 14-11-00109).


DOI: https://doi.org/10.15826/umj.2018.2.006

Full text: PDF file (360 kB)
Full text: https:/.../118
References: PDF file   HTML file

Bibliographic databases:

Language:

Citation: Alexander G. Chentsov, Alexey M. Grigoriev, Alexey A. Chentsov, “Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions”, Ural Math. J., 4:2 (2018), 43–55

Citation in format AMSBIB
\Bibitem{CheGriChe18}
\by Alexander~G.~Chentsov, Alexey~M.~Grigoriev, Alexey~A.~Chentsov
\paper Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions
\jour Ural Math. J.
\yr 2018
\vol 4
\issue 2
\pages 43--55
\mathnet{http://mi.mathnet.ru/umj62}
\crossref{https://doi.org/10.15826/umj.2018.2.006}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=MR3901584}
\elib{https://elibrary.ru/item.asp?id=36702172}


Linking options:
  • http://mi.mathnet.ru/eng/umj62
  • http://mi.mathnet.ru/eng/umj/v4/i2/p43

    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
  • Ural Mathematical Journal
    Number of views:
    This page:119
    Full text:65
    References:21

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