An eugenetic algorithm for delay-constrained minimum-cost routing of multipoint connections
An eugenetic algorithm for delay-constrained minimum-cost routing of multipoint connections
Author(s): Peter Kortiš, Vladimír Olej, Karol BlunárSubject(s): Methodology and research technology, ICT Information and Communications Technologies
Published by: Žilinská univerzita v Žilině
Keywords: eugenetic algorithm; minimum-cost tree; delay constraints; Telecommunication network;
Summary/Abstract: 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.
Journal: Komunikácie - vedecké listy Žilinskej univerzity v Žiline
- Issue Year: 6/2004
- Issue No: 4
- Page Range: 22-27
- Page Count: 6
- Language: English