Application of Genetic Algorithms in Solving the Problem of Placing Elements on a Crystal Taking into Account the Criterion of the Maximum Number of Linear Segments

Abstract

A bionspirited approach to solving the problem of placing elements on a crystal based on a genetic algorithm (GA) is described, which makes it possible to create an algorithmic environment in the field of genetic search for solving the problem of placing elements on a crystal, taking into account the criterion of the maximum number of linear segments. The purpose of this work is to find ways of placing elements on a crystal based on the bionspirated theory. The scientific novelty lies in the development of a modified genetic algorithm for bionspired computer-aided design, taking into account the criterion of the maximum number of linear segments. The statement of the problem in this work is as follows: to optimize the placement of elements on the chip by using a modified GA taking into account the criterion for the maximum number of line segments. A fundamental difference from the known approaches in the use of new modified genetic structures in bionspirated computer-aided design, in addition, the work presents a new method of placing elements on a crystal, based on a modified GA, taking into account the criterion of the maximum number of linear segments. Thus, the problem of creating methods, algorithms and software for automated placement of elements on a chip is currently of particular relevance.KeywordsGenetic algorithmsEvolutionary computingAutomation of the placement of elements on a chipComputer-aided design systemsSchematic diagramTopology