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: | , , , |
|---|---|
| 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!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1000-436X |