RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Guidelines for authors Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Izv. IMI UdGU: Year: Volume: Issue: Page: Find

 Izv. IMI UdGU, 2018, Volume 52, Pages 103–115 (Mi iimi364)

On one routing task with the optimization of the start–finish point

A. G. Chentsovab, P. A. Chentsovab

a Ural Federal University, ul. Mira, 19, Yekaterinburg, 620002, Russia
b N. N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi, 16, Yekaterinburg, 620990, Russia

Abstract: The optimizing procedure for solving the problem of sequential visiting of megacities under precedence conditions and cost functions depending on the tasks list is considered. The formulation of the problem closed in the sense of coincidence of the starting point (process base) and terminal state is investigated (this is an analog of the closed travelling salesman problem). This condition is natural for applied problems concerning series of procedures with elements of routing. In particular, in problems involved in sheet cutting on CNC, in working with a series of parts corresponding to one cutting plan, the cutting tool must be returned to the starting point for repeated operations. In this setting, optimization of the starting point is interesting not only for theoretical, but also practical reasons. In a mathematical setting, it is not necessary to require the above-mentioned return to the starting point: this condition can be reflected by introducing the corresponding terminal function whose argument is the last point of visiting in the contours of the parts. Such an approach allows one to cover some more general cases where the cost of the terminal state, which includes the starting point in the form of a parameter, is given. As a result, the starting point and the finishing point are related by a functional dependence in the form of the value defining the quality of the final state of the process. This representation is used in the article.

Keywords: route, track, precedence conditions.

 Funding Agency Grant Number Russian Foundation for Basic Research 18-07-00637_à The research was supported by the Russian Foundation for Basic Research (project no. 18–07–00637).

DOI: https://doi.org/10.20537/2226-3594-2018-52-08

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

Bibliographic databases:

UDC: 519.6
MSC: 93C83

Citation: A. G. Chentsov, P. A. Chentsov, “On one routing task with the optimization of the start–finish point”, Izv. IMI UdGU, 52 (2018), 103–115

Citation in format AMSBIB
\Bibitem{CheChe18} \by A.~G.~Chentsov, P.~A.~Chentsov \paper On one routing task with the optimization of the start--finish point \jour Izv. IMI UdGU \yr 2018 \vol 52 \pages 103--115 \mathnet{http://mi.mathnet.ru/iimi364} \crossref{https://doi.org/10.20537/2226-3594-2018-52-08} \elib{https://elibrary.ru/item.asp?id=36508459} 

• http://mi.mathnet.ru/eng/iimi364
• http://mi.mathnet.ru/eng/iimi/v52/p103

 SHARE:

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
2. A. G. Chentsov, P. A. Chentsov, “K voprosu ob optimizatsii tochki starta v zadache marshrutizatsii s ogranicheniyami”, Izv. IMI UdGU, 55 (2020), 135–154
•  Number of views: This page: 147 Full text: 61 References: 12