RT Journal Article
SR Electronic
A1 Kortis, Peter
A1 Olej, Vladimir
A1 Blunar, Karol
T1 An eugenetic algorithm for delay-constrained minimum-cost routing of multipoint connections
JF Communications - Scientific Letters of the University of Zilina
YR 2004
VO 6
IS 4
SP 22
OP 27
DO 10.26552/com.C.2004.4.22-27
UL https://komunikacie.uniza.sk/artkey/csl-200404-0004.php
AB A special kind of genetic algorithm - eugenic algorithm is presented for constructing minimum-cost tree with delay constraints. Telecommunication network is represented by an undirected graph, which uses three independent metrics: cost, delay and capacity. The efficiency of two different bit representations of individuals (adjacent matrix, list of vertices) is compared.