求解度约束最小生成树的新的遗传算法

计算机工程与应用 ›› 2006, Vol. 42 ›› Issue (31): 13-.

求解度约束最小生成树的新的遗传算法

韩丽霞,王宇平

西安电子科技大学

收稿日期:2006-07-18 修回日期:1900-01-01 出版日期:2006-11-01 发布日期:2006-11-01
通讯作者: 韩丽霞 hanlixia

A Nove Genetic Algorithm for the Degree-constrained Minimum Spanning Tree Problem

Lixia Han,

西安电子科技大学

Received:2006-07-18 Revised:1900-01-01 Online:2006-11-01 Published:2006-11-01
Contact: Lixia Han

摘要/Abstract

摘要： 针对度约束最小生成树问题的特征，设计了一种新的编码方式，并在此基础上提出了一个新遗传算法来求解该问题。该算法采用新的启发式杂交算子、变异算子和局部搜索算子，理论分析表明该算法以概率1收敛到全局最优解。数值实验表明该算法优于其他四个算法。

关键词: 遗传算法最小生成树全局收敛性组合优化

Abstract: For the degree-constrained minimum spanning tree problem, a new encoding scheme was presented based on its characters. And then a genetic algorithm was proposed. Heuristics crossover operator, mutation operator and local search scheme were designed in the algorithm and its convergence to global optimal solution with probability one was proved. At last, the simulated results indicate that this method is effective than other four algorithms.

Key words: Genetic algorithm, minimum spanning tree, global convergence, combinatorial optimization

韩丽霞,王宇平.

求解度约束最小生成树的新的遗传算法

[J]. 计算机工程与应用, 2006, 42(31): 13-.

Lixia Han,. A Nove Genetic Algorithm for the Degree-constrained Minimum Spanning Tree Problem[J]. Computer Engineering and Applications, 2006, 42(31): 13-.