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...
Saved in:
Main Authors: | PAN Yun1, WANG Xing-gang2, FENG Yan-li3, YU Zhen-wei4 |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2007-01-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/74659604/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Multicast routing with delay constrain based on improved CSA
by: ZHANG Jing, et al.
Published: (2009-01-01) -
Delay constraint supported overlay multicast routing protocol
by: WU Jia-gao, et al.
Published: (2005-01-01) -
Low-power multicast routing algorithm in green Internet
by: Jin-hong ZHANG, et al.
Published: (2014-10-01) -
Hybrid genetic simulated annealing algorithm based on niching for QoS multicast routing
by: FAN Yi-ming1, et al.
Published: (2008-01-01) -
Load balance multicast routing algorithms on overlay network
by: ZHANG Xiao-yu, et al.
Published: (2009-01-01)