Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/111606
Title: On sequential traversal of sets
Other Titles: Об одной задаче последовательного обхода множеств
Authors: Chentsov, A. G.
Chentsov, P. A.
Issue Date: 2021
Publisher: Udmurt State University
Udmurt State University
Citation: Chentsov A. G. On sequential traversal of sets [Об одной задаче последовательного обхода множеств] / A. G. Chentsov, P. A. Chentsov // Vestnik Udmurtskogo Universiteta: Matematika, Mekhanika, Komp'yuternye Nauki. — 2021. — Vol. 31. — Iss. 3. — P. 487-504.
Abstract: The problem of sequential traversal of megapolises with precedence conditions is investigated; this problem is oriented to mechanical engineering — CNC metal cutting machines. There is the following setting singularity: the terminal component of additive criterion contains the dependence on the starting point. This singularity leads to the fact that the natural solution procedure based on dynamic programming must be applied individually for every starting point. The investigation goal consists in the construction of an optimizing algorithm for determining a complex including a route (a variant of megapolis numbering), a trajectory, and a starting point. The proposed algorithm realizes an idea of directed enumeration of starting points. This algorithm is realized as a program for PC; computations for model examples are made. © 2021 Udmurt State University. All rights reserved.
Keywords: DYNAMIC PROGRAMMING
ROUTE OPTIMIZATION
START POINT OPTIMIZATION
URI: http://hdl.handle.net/10995/111606
Access: info:eu-repo/semantics/openAccess
SCOPUS ID: 85117137050
PURE ID: 23822290
ISSN: 1994-9197
metadata.dc.description.sponsorship: The study was funded by the Russian Foundation for Basic Research (project No. 20–08– 00873).
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-85117137050.pdf2,03 MBAdobe PDFView/Open


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