The Design of the Minimum Spanning Tree Algorithms ()
Abstract
Based on the graphic theory and improved genetic algorithm,an improved genetic algorithm to search the minimum spanning trees is given . The algorithm uses binary code to represent the problem of minimum spanning trees. It designs the corresponding fitness function,operator and few controlling strategies to improve its speed and evolutionary efficiency.Only one solution can be gotten with running traditional al-gorithem atone time.The new algorithm can get a set of the solutions with higher probability in a shorter time.The experiment shows that it has a better performance than traditional methods.
Share and Cite:
Z. LIU and B. JIANG, "The Design of the Minimum Spanning Tree Algorithms,"
Intelligent Information Management, Vol. 1 No. 1, 2009, pp. 56-59. doi:
10.4236/iim.2009.11010.
Conflicts of Interest
The authors declare no conflicts of interest.
References
|
[1]
|
Chen Guo-Liang,The Algorim of Genetic and The Applica-tion[M]. Beijing: People's post publishing house,1996.(in Chinese) (陳國良，遺傳演算法及應用 [M]. 北京：人民郵電出版社，1996).
|
|
[2]
|
Xie Jin-Xing,Xing Wen-Xun. Optimization of the Network [M].BeiJing:the publishing of the QingHua University,2000(in Chinese) (謝金星，刑文訓. 網路優化[M]. 北京：清華大學出版社，2000).
|