Communications - Scientific Letters of the University of Zilina 2004, 6(4):22-27 | DOI: 10.26552/com.C.2004.4.22-27

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

Peter Kortis1, Vladimir Olej2, Karol Blunar1
1 Department of Telecommunications, Faculty of Electrical Engineering, University of Zilina, Slovak Republic
2 Institute of System Engineering and Informatics, Faculty of Economics and Administration, University of Pardubice, Czech Republic

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.

Keywords: no keywords

Published: December 31, 2004  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
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. doi: 10.26552/com.C.2004.4.22-27
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. PRIOR, J. W.: Eugenic Evolution for Combinatorial Optimization. Report AI 98 - 268. Artificial Intelligence Laboratory. The University of Texas at Austin. 1998.
    2. KAPSALIS, A., RAYWARD, SMITH, V. J., SMITH, G. D.: Solving the Graphical Steiner Tree Problem Using Genetic Algorithms. Journal of the Operational Research Society. Vol. 44, No.4, 1993, pp. 397-406. Go to original source...
    3. OLEJ, V.: Evolution Stochastic Optimization Algorithms: Genetic Algorithms and Evolution Strategies. Electrical Engineering Journal, ISSN 1335-3632, Vol. 50, No. 9-10, 1999, pp. 266-272.
    4. OLEJ, V.: Prediction of Gross Domestic Product Development by Frontal Neural Networks with Learning Process on the Basis Genetic and Eugenic Algorithms. Neural Network World, International Journal on Non-Standard Computing and Artificial Intelligence, editor: M. Novák, ISSN 1210-0552, Czech Republic, Vol. 12, No. 3, 2002, pp. 279-291.
    5. OLEJ, V.: Prediction of Gross Domestic Product Development on the Basis of Frontal Neural Networks, Genetic and Eugenic Algorithms. 2nd Euro - International Symposium on Computational Intelligence, E - ISCI 2002, Intelligent Technologies - Theory and Applications, New Trend in Intelligent Technologies, IOS Press Ohmsha, ISSN 0922-6389, ISBN 1 58603 256 9 IOS Press, ISBN 4 274 90512 8 Ohmsha, Netherlands, 2002, pp. 309-314.
    6. ITU, T.: Recommendation F.700: Framework Recommendation for audiovisual/ multimedia services. July 1996.
    7. ESBENSEN, H.: Computing Near - Optimal Solutions to the Steiner Problem in a Graph Using Genetic Algorithm [online], 1995. http://www.daimi.au.dk/PB/468/PB-468.ps.gz>. Go to original source...
    8. VRBA, R.: Možnosti tvorby viacbodových spojení v sieťach B - ISDN pomocou evolučných stochastických optimalizačných algoritmov. Dizertačná práca, Žilinská univerzita, Elektrotechnická fakulta, Žilina, 2000.
    9. RAYWARD, SMITH, V. J., CLARE, A.: On Finding Steiner Vertices. Networks. Vol. 16. 1986. pp. 283-294. Go to original source...
    10. TANAKA, Y., HUANG, P. C.: Multiple Destination Routing Algorithms. IEICE Transaction on Communications. Vol. E76-B. No. 5. 1993. s. 544-552.

    This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content