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., 2018, Volume 11, Issue 2, Pages 83–95 (Mi vyuru433)  

This article is cited in 1 scientific paper (total in 1 paper)

Mathematical Modelling

Optimization of the start point in the GTSP with the precedence conditions

A. G. Chentsovab, P. A. Chentsovab

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

Abstract: The paper is devoted to the routing problem with constraints and cost functions that can depend on the list of tasks. It is assumed that the initial condition for the process with discrete time can be selected within a metric space that satisfies the condition of complete boundedness. It is supposed that the problem includes a visiting of a finite system of megalopolises (non-empty finite sets) with the fulfillment of some works. The cost of these works each time depend on the point of arrival and the point of departure. The costs of movement and work are aggregated additively. For the problem solution widely understood dynamic programming method providing $\varepsilon$-optimal solution for any $\varepsilon>0$ is used.

Keywords: route task; restrictions; start point.

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


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

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

UDC: 519.6
MSC: 93CXX
Received: 10.04.2018

Citation: A. G. Chentsov, P. A. Chentsov, “Optimization of the start point in the GTSP with the precedence conditions”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 11:2 (2018), 83–95

Citation in format AMSBIB
\Bibitem{CheChe18}
\by A.~G.~Chentsov, P.~A.~Chentsov
\paper Optimization of the start point in the GTSP with the precedence conditions
\jour Vestnik YuUrGU. Ser. Mat. Model. Progr.
\yr 2018
\vol 11
\issue 2
\pages 83--95
\mathnet{http://mi.mathnet.ru/vyuru433}
\crossref{https://doi.org/10.14529/mmp180207}
\elib{https://elibrary.ru/item.asp?id=35250092}


Linking options:
  • http://mi.mathnet.ru/eng/vyuru433
  • http://mi.mathnet.ru/eng/vyuru/v11/i2/p83

    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. 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
  • Number of views:
    This page:128
    Full text:26
    References:19

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