THE ALGORITHM OF SUBSIDIARY METAHEURISTICS

Author(s): Tsvetkov V.Ya., Kozlov A.V.

Rubric: Information technology

DOI: 10.21777/2500-2112-2022-4-65-71

Release: 2022-4 (41)

Pages: 65-71

Keywords: metaheuristics, subsidiary system, situational behavior, metaheuristic algorithm, coverage algorithm

Annotation: The article explores a new direction “subsidiary metaheuristics”. The article proposes a new metaheuristic algorithm, which the authors called the coverage algorithm. The difference between heuristics and metaheuristics in relation to subsidiary systems is shown. Metaheuristic algorithms are modifiable according to the control situation. The iterative process of finding solutions is common to heuristics and metaheuristics. The significance of the situation for metaheuristic transformations is shown. A typical scheme of heuristic algorithms with a fixed sequence of actions is presented. An example of the formation of algorithms of subsidiary metaheuristics is described. The problem of covering an arbitrary-shaped area with areas is considered. The complexity of the problem lies in the fact that this area is unknown and is determined iteratively during the coating process. It is shown that subsidiary systems and algorithms are multi-purpose, a group of typical goals of a subsidiary algorithm is identified. The algorithm of covering the area of the site with areas associated with the movement of the robot is described. The feature of the metaheuristics algorithm is the use of information from sensors. It is noted that a subsidiary system with a metaheuristic control algorithm should include coordination mechanisms in space.

Bibliography: Tsvetkov V.Ya., Kozlov A.V. THE ALGORITHM OF SUBSIDIARY METAHEURISTICS // Education Resources and Technologies. – 2022. – № 4 (41). – С. 65-71. doi: 10.21777/2500-2112-2022-4-65-71