ABSTRACTS OF ARTICLES OF THE JOURNAL "INFORMATION TECHNOLOGIES".
No. 2. Vol. 28. 2022

DOI: 10.17587/it.28.59-67

O. B. Lebedev, Cand. of Eng. Sc., Associate Professor, A. A. Zhiglatiy, Graduate Student,
E. O. Lebedeva, Graduate Student, Southern Federal University, Rostov-on-Don, 344006, Russian Federation

Co-Evolutionary Approach to Solving the Problem of Placing VLSI Elements

The paper considers a co-evolutionary algorithm for solving the placement problem based on the ant colony algorithm. A modified structure of the ant algorithm is proposed. An evolving population is divided into subpopulations that evolve in parallel. The strategies implemented by subpopulations differ in constructive algorithms that are part of the ant algorithm. The heuristic of the ant colony constructive algorithm is based on the concept of sequential assignment of elements to previously placed positions of the commutation field. The developed algorithm was tested on benchmarks 19s, PrimGA1, PrimGA2. The results compared to existing algorithms are improved by 6—7 %. The total time complexity of the co-evolutionary allocation algorithm is O(n²)—O(n³).
Keywords: VLSI, placement, swarm intelligence, ant algorithm, adaptive behavior, subpopulation, co-evolution, optimization

P. 59-67

Acknowledgements: This work was supported by the Russian Foundation for Basic Research (project no. 20-07-00260à).

To the contents