| 基于新的树编码方式用免疫遗传算法解决DCMST问题 |
| |
| 引用本文： | 尉志青.基于新的树编码方式用免疫遗传算法解决DCMST问题[J].世界科技研究与发展,2009,31(6):1063-1065. |
| |
| 作者姓名： | 尉志青 |
| |
| 作者单位： | 北京邮电大学通信工程系,北京,100876 |
| |
| 摘 要： | 本文提出了一种新的树编码方式，可以方便地表达一棵树，简化了树在遗传算法中的编码表达。且新的树编码方式清楚地表达了边的信息，有利于疫苗的设计。此外，本文使用免疫遗传算法，有效地克服了传统遗传算法中解退化的现象。数值实验表明，解的振荡相对于传统遗传算法减小了，且收敛速度更快。
|
| 关 键 词： | 免疫遗传算法 度约束最小生成树 树编码 |
Solving the DCMST Problem with Immune Evolutionary Algorithm based on a New Tree Encoding |
| |
| WEi Zhiqing.Solving the DCMST Problem with Immune Evolutionary Algorithm based on a New Tree Encoding[J].World Sci-tech R & D,2009,31(6):1063-1065. |
| |
| Authors: | WEi Zhiqing |
| |
| Institution: | WEI Zhiqing ( Department of Information and Telecommunications, Beijing University of Posts and Telecommunications, Beijing 100876) |
| |
| Abstract: | In this paper,a new tree encoding is developed directly based on the Prior node. Thns,a tree can be represented easily,which make the encoding in GAs very simple Besides, in this paper, immune evolutionary algorithm is used to overcome the degradation of solutions in the traditional GA. Numerical experiments showed that the oscillation of solutions is much lighter,and the convergence speed is much faster. |
| |
| Keywords: | immune evolutionary algorithm degree-constrained spanning tree problem tree encoding |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
