ABSTRACTS OF ARTICLES OF THE JOURNAL "INFORMATION TECHNOLOGIES".
No. 11. Vol. 25. 2019

DOI: 10.17587/it.25.670-678

B. K. Lebedev, Doctor of Engineering Sciences, Professor, e-mail: lebedev.b.k@gmail.com, O. B. Lebedev, Candidate of Engineering Sciences, Associate Professor, e-mail: lebedev.ob@mail.ru, Southern Federal University, Rostov-on-Don, 344006, Russian Federation, O. A. Purchina, Assistant, e-mail: knagna_olga@inbox.ru, Don State Technical University, Rostov-on-Don, 344000, Russian Federation

Modified Swarm Algorithm "Ant Tree" in the Problem of Diversification of Tractor Resources

A modified swarm algorithm (trees ant colony optimization (T-ACO)) is proposed. The difference from the canonical structure is that the decision tree is used as a decision search graph. An agent for the decision search graph does not create a route, but a tree, which in its structure coincides with the representation of the solution to the trace problem in the "over-the-cell" region. This eliminates the use of additional transformations in the decoding process of decisions that allow interpretation of decisions in the form of trees and allows you to discard a lot of "illegal" solutions, which leads to an increase in the quality of the solutions obtained. Using the tracing procedure in "over-the-cell" based on the ant algorithm allows you to unload the channel by 15—20 %. The time complexity of the algorithm depends on the number of vertices n of the decision search graph, the number of agents y, the number of iterations l, and is defined as O(n²ly).
Keywords: optimization, "ant tree" algorithm, CAD VLSI, diversification of trace resources, "over-the-cell" area, planar sketch of topology

P. 670–678

Acknowledgements: This work was supported by the Russian Foundation for Basic Research (Grant ¹ 18-07-00737à).

To the contents