Solving degree-constrained multicast routing problem by a heuristic genetic algorithm

With the purpose to solve the degree constrained multicast routing model efficiently,the evolutionary strategy was introduced into heuristic search methods by employing the chromosome as the heuristic information for global searching,and then a hybrid genetic algorithm was proposed.The algorithm not...

Descripción completa

Detalles Bibliográficos
Autores principales: PAN Yun1, WANG Xing-gang2, FENG Yan-li3, YU Zhen-wei4
Formato: Artículo
Lenguaje:zho
Publicado: Editorial Department of Journal on Communications 2007-01-01
Colección:Tongxin xuebao
Materias:
Acceso en línea:http://www.joconline.com.cn/zh/article/74659604/
_version_ 1826873191589478400
author PAN Yun1
WANG Xing-gang2
FENG Yan-li3
YU Zhen-wei4
author_facet PAN Yun1
WANG Xing-gang2
FENG Yan-li3
YU Zhen-wei4
author_sort PAN Yun1
collection DOAJ
description With the purpose to solve the degree constrained multicast routing model efficiently,the evolutionary strategy was introduced into heuristic search methods by employing the chromosome as the heuristic information for global searching,and then a hybrid genetic algorithm was proposed.The algorithm not only avoids the difficulty of coding for multicast trees,but also possesses fast convergency and global optimizing capability.Meanwhile,the efficiency of the method is supported by a great number of numerical experiments.
first_indexed 2025-02-17T00:13:34Z
format Article
id doaj.art-c1c90a21f28641c8a1160204e42f91ce
institution Directory Open Access Journal
issn 1000-436X
language zho
last_indexed 2025-02-17T00:13:34Z
publishDate 2007-01-01
publisher Editorial Department of Journal on Communications
record_format Article
series Tongxin xuebao
spelling doaj.art-c1c90a21f28641c8a1160204e42f91ce2025-01-14T08:36:55ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2007-01-019610274659604Solving degree-constrained multicast routing problem by a heuristic genetic algorithmPAN Yun1WANG Xing-gang2FENG Yan-li3YU Zhen-wei4With the purpose to solve the degree constrained multicast routing model efficiently,the evolutionary strategy was introduced into heuristic search methods by employing the chromosome as the heuristic information for global searching,and then a hybrid genetic algorithm was proposed.The algorithm not only avoids the difficulty of coding for multicast trees,but also possesses fast convergency and global optimizing capability.Meanwhile,the efficiency of the method is supported by a great number of numerical experiments.http://www.joconline.com.cn/zh/article/74659604/multicast routinggenetic algorithmdegree-constrainedheuristic search
spellingShingle PAN Yun1
WANG Xing-gang2
FENG Yan-li3
YU Zhen-wei4
Solving degree-constrained multicast routing problem by a heuristic genetic algorithm
Tongxin xuebao
multicast routing
genetic algorithm
degree-constrained
heuristic search
title Solving degree-constrained multicast routing problem by a heuristic genetic algorithm
title_full Solving degree-constrained multicast routing problem by a heuristic genetic algorithm
title_fullStr Solving degree-constrained multicast routing problem by a heuristic genetic algorithm
title_full_unstemmed Solving degree-constrained multicast routing problem by a heuristic genetic algorithm
title_short Solving degree-constrained multicast routing problem by a heuristic genetic algorithm
title_sort solving degree constrained multicast routing problem by a heuristic genetic algorithm
topic multicast routing
genetic algorithm
degree-constrained
heuristic search
url http://www.joconline.com.cn/zh/article/74659604/
work_keys_str_mv AT panyun1 solvingdegreeconstrainedmulticastroutingproblembyaheuristicgeneticalgorithm
AT wangxinggang2 solvingdegreeconstrainedmulticastroutingproblembyaheuristicgeneticalgorithm
AT fengyanli3 solvingdegreeconstrainedmulticastroutingproblembyaheuristicgeneticalgorithm
AT yuzhenwei4 solvingdegreeconstrainedmulticastroutingproblembyaheuristicgeneticalgorithm