A genetic algorithm for solving the delay-constrained multicast routing problem
Joint Authors
Bakr, A. A.
Jirjis, M. R.
Mahmud, T. M.
Source
International Journal of Intelligent Computing and Information Sciences
Issue
Vol. 7, Issue 1 (31 Jan. 2007)7 p.
Publisher
Ain Shams University Faculty of Computer and Information Sciences
Publication Date
2007-01-31
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Information Technology and Computer Science
Topics
Abstract EN
This study deals with the delay-constrained multicast routing problem.
This problem is known to be NP-complete.
We propose a genetic algorithm approach to solve this problem.
In this approach, we introduced a new representation for the chromosome which contributed in the improvement of the GA results.
Then we compare the proposed approach with one of the known heuristic algorithms to solve the considered problem.
The experimental results showed that the proposed genetic algorithm is more efficient in finding a good solution of the delay constrained multicast routing problem than the heuristic algorithm.
American Psychological Association (APA)
Mahmud, T. M.& Jirjis, M. R.& Bakr, A. A.. 2007. A genetic algorithm for solving the delay-constrained multicast routing problem. International Journal of Intelligent Computing and Information Sciences،Vol. 7, no. 1.
https://search.emarefa.net/detail/BIM-284993
Modern Language Association (MLA)
Mahmud, T. M.…[et al.]. A genetic algorithm for solving the delay-constrained multicast routing problem. International Journal of Intelligent Computing and Information Sciences Vol. 7, no. 1 (Jan. 2007).
https://search.emarefa.net/detail/BIM-284993
American Medical Association (AMA)
Mahmud, T. M.& Jirjis, M. R.& Bakr, A. A.. A genetic algorithm for solving the delay-constrained multicast routing problem. International Journal of Intelligent Computing and Information Sciences. 2007. Vol. 7, no. 1.
https://search.emarefa.net/detail/BIM-284993
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references.
Record ID
BIM-284993