Vestnik Yuzhno-Ural'skogo Universiteta. Seriya Matematicheskoe Modelirovanie i Programmirovanie
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Vestnik YuUrGU. Ser. Mat. Model. Progr.:
Year:
Volume:
Issue:
Page:
Find






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


Vestnik YuUrGU. Ser. Mat. Model. Progr., 2020, Volume 13, Issue 1, Pages 64–80 (Mi vyuru531)  

Mathematical Modelling

On one routing problem with non-additive cost aggregation

A. G. Chentsovab, A. A. Chentsova, A. N. Sesekinab

a Krasovskii Institute of Mathematics and Mechanics UrB RAS, Yekaterinburg
b Ural Federal University, Yekaterinburg, Russian Federation

Abstract: We investigate the problem on sequential round of megalopolises (nonempty finite sets) with preceding conditions and nonadditive aggregation of costs. We suppose that a variant of aggregation with respect to “external” phase (by the estimation of the system of cycles, which are determined every time by the “external” movement and internal jobs) corresponds to the “bottleneck” problem with the correction parameter. At the “internal” phase (within the cycle), an aggregation of costs with respect to external movement and carrying out works can be arbitrary. We construct nonadditive variant of the procedure of dynamic programming (DP) including economical variant, which uses preceding conditions. In the form of a program for a personal computer, we realize the optimal algorithm based on DP for the statement oriented to the problem on control of an autonomous system, which works in aggressive environment and implements a sequential process of dismantling of the sources of exposures (of this environment) to the system. Such a statement can correspond to the engineering problem on sequential dismantling of the sources of radiation under emergency situations on the nuclear power plants in the case of application of the robotic system with electronic equipment, which can work only if tolerances are complied with respect to influence of radiation during entire time interval. For this variant of the general statement, we implement a calculation experiment by means of a personal computer.

Keywords: dynamic programming, route, preceding conditions.

Funding Agency Grant Number
Russian Academy of Sciences - Federal Agency for Scientific Organizations


DOI: https://doi.org/10.14529/mmp200105

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

UDC: 519.6
MSC: 90C39
Received: 10.08.2019

Citation: A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “On one routing problem with non-additive cost aggregation”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 13:1 (2020), 64–80

Citation in format AMSBIB
\Bibitem{CheCheSes20}
\by A.~G.~Chentsov, A.~A.~Chentsov, A.~N.~Sesekin
\paper On one routing problem with non-additive cost aggregation
\jour Vestnik YuUrGU. Ser. Mat. Model. Progr.
\yr 2020
\vol 13
\issue 1
\pages 64--80
\mathnet{http://mi.mathnet.ru/vyuru531}
\crossref{https://doi.org/10.14529/mmp200105}


Linking options:
  • http://mi.mathnet.ru/eng/vyuru531
  • http://mi.mathnet.ru/eng/vyuru/v13/i1/p64

    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
  • Number of views:
    This page:35
    Full text:7

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021