Open AccessOn sequential traversal of sets
Author(s) -
А. Г. Ченцов,
P. A. Chentsov
Publication year - 2021
Publication title -
vestnik udmurtskogo universiteta. matematika, mehanika, kompʹûternye nauki
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.354
H-Index - 8
eISSN - 2076-5959
pISSN - 1994-9197
DOI - 10.35634/vm210310
Subject(s) - tree traversal , singularity , point (geometry) , algorithm , computer science , traverse , component (thermodynamics) , numbering , trajectory , computation , mathematical optimization , mathematics , theoretical computer science , mathematical analysis , physics , geometry , geodesy , astronomy , thermodynamics , geography
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.