An eugenetic algorithm for delay-constrained minimum-cost routing of multipoint connections

  • Peter Kortis
  • Vladimir Olej
  • Karol Blunar
Keywords: no keywords

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.

Author Biographies

Peter Kortis

Department of Telecommunications, Faculty of Electrical Engineering, University of Zilina, Slovak Republic

Vladimir Olej

Institute of System Engineering and Informatics, Faculty of Economics and Administration, University of Pardubice, Czech Republic

Karol Blunar

Department of Telecommunications, Faculty of Electrical Engineering, University of Zilina, Slovak Republic

Published
2004-12-31
How to Cite
Kortis, P., Olej, V., & Blunar, K. (2004). An eugenetic algorithm for delay-constrained minimum-cost routing of multipoint connections. Communications - Scientific Letters of the University of Zilina, 6(4), 22-27. Retrieved from http://journals.uniza.sk/index.php/communications/article/view/1316
Issue
Vol 6 No 4 (2004)
Section
Articles