An eugenetic algorithm for delay-constrained minimum-cost routing of multipoint connections
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 represe...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Žilina
2004-12-01
|
| Series: | Communications |
| Subjects: | |
| Online Access: | https://komunikacie.uniza.sk/artkey/csl-200404-0004_an-eugenetic-algorithm-for-delay-constrained-minimum-cost-routing-of-multipoint-connections.php |