2005 | OriginalPaper | Buchkapitel
Hybrid Genetic Algorithm for Solving the Degree-Constrained Minimal Bandwidth Multicast Routing Problem
verfasst von : Yun Pan, Zhenwei Yu, Licheng Wang
Erschienen in: Computational Intelligence and Security
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, we propose a programming model for the degree-constrained minimal bandwidth multicast routing problem in overlay networks, and design a hybrid genetic algorithm to solve it. The algorithm combines heuristic searching and genetic searching together for global optimal seeking. The complexity analysis and numerical experiments suggest our proposed model and algorithm are practical and efficient.