Abstract
One of the variants of the routing problem on a plane integer lattice is considered. It is shown that this problem can be represented as a problem of searching for words with certain properties over a finite alphabet. In turn, the problem of finding optimal words can be considered as a problem of fragmentary structure. A combinatorial estimate for the set of feasible words is derived and the lower bound of the density is established for the problem of finding optimal line density. An evolutionary-fragmentary model of the routing problem is constructed. Optimal and near-optimal solutions are obtained for this problem for small dimensions.
Similar content being viewed by others
References
A. Kernytskyy, R. Kryvyy, and S. Tkatchenko, “VLSI topology synthesis using the method of parallel genetic algorithms,” in: Proc. 3rd Intern. Conf. of Young Scientists MEMSTECH’2007, May 23–26, 2007, Polyana, Lviv (2007), pp. 151–152.
B. K. Lebedev and E. I. Voronin, “Genetic algorithm of the distribution of connecting layers for multilayered global routing of VLSI,” Izv. YuFU, Tekhn. Nauki, Special Issue: Intelligent CAD, 132, No. 7, 14–21 (2012).
L. A. Gladkov and S. N. Shcheglov, “Synthesis of the architecture of hybrid intelligent systems on the basis of self-organization and self-regulation principles,” in: Trans. of Intern. Conf. IEEE AIS’02 and ISAPR’2002, Fizmatlit, Moscow (2002), pp. 173–180.
D. Korpyljov, T. Sviridova, and S. Tkachenko, “Using of genetic algorithms in design of Hybrid Integrated Circuits,” in: Proc. 9th Intern. Conf. on the Experience of Designing and Application of CAD Systems in Microelectronics, February, 20–24, 2007, Polyana, Lviv (2007), p. 302.
J. Lienig, “Physical design of VLSI circuits,” in: D. Dasgupta and Z. Michalewicz (eds.), Evolutionary Algorithms in Engineering Applications, Springer, Berlin (1997), pp. 277–293.
Chi Keong Goh, Wei Ling, Yong Han Chew, and Kay Chen Tan, “A multi-objective evolutionary algorithm for channel routing problems,” in: K. P. Dahal and P. I. Cowling (eds.), Evolutionary Scheduling, Springer, Berlin (2007), pp. 404–436.
V. Schnecke, “Genetic design of VLSI layouts,” in: A. M. S. Zalzala and P. J. Flemming (eds.), Genetic Algorithms in Engineering Systems, The Institution of Electrical Engineers, London (1997), pp. 229–253.
I. Sh. Nevlyudov, S. V. Kurapov, et al., “Routing of the connecting plate of a multiple-sonde devices for monitoring of BGA-components,” in: Proc. 6th Intern. Sci. Conf. “Functional basis of nanoelectronics,” KhNURE, Kharkov (2013), pp. 129–132.
I. V. Kozin and S. I. Polyuga, “Properties of fragmentary structures,” Visnyk Zapor. Nats. Univer., Mathematical Modeling and Applied Mechanics, No. 1, 99–106 (2012).
I. V. Kozin and S. I. Polyuga, “Using EVF algorithms to solve the rectangular cut problem,” Issues of Applied Mathematics and Mathematical Modeling, Izd. Dnipropetr. Nats. Univer., Dnipropetrovsk (2009), pp. 199–208.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 3, May–June, 2015, pp. 125–131.
Rights and permissions
About this article
Cite this article
Kozin, I.V., Kryvtsun, O.V. & Pinchuk, V.P. Evolutionary-Fragmentary Model of the Routing Problem. Cybern Syst Anal 51, 432–437 (2015). https://doi.org/10.1007/s10559-015-9734-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-015-9734-9