计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (12): 53-56.

• 理论研究 • 上一篇    下一篇

基于prüfer数的遗传算法求解度约束最小树问题

牧云志,周根贵   

  1. 浙江工业大学 经贸管理学院,杭州 310023
  • 收稿日期:2007-08-17 修回日期:2007-11-19 出版日期:2008-04-21 发布日期:2008-04-21
  • 通讯作者: 牧云志

Genetic algorithm based on prüfer number for solving Degree-Constrained Minimum Spanning Tree Problem

MU Yun-zhi,ZHOU Gen-gui   

  1. College of Business Administration,Zhejiang University of Technology,Hangzhou 310023,China
  • Received:2007-08-17 Revised:2007-11-19 Online:2008-04-21 Published:2008-04-21
  • Contact: MU Yun-zhi

摘要: 度约束最小树问题属于NP-完全问题,是一类比较难解的问题,但在现实中具有非常重要的应用价值。探讨了如何将基于prüfer数的遗传算法应用于该问题,并给出了相应的算法。采用C语言和MATLAB的混合编程实现该算法,数值分析的结果显示了遗传算法求解该问题的有效性及其应用价值。

关键词: prüfer数, 遗传算法, 最小生成树, 度约束

Abstract: The Degree-Constrained Minimum Spanning Tree problem(DCMST) is difficult to be solved because of its NP-hard complexity.But it’s very important because of its value in practice.In this paper,we discuss how to solve this problem by means of genetic algorithm based on prüfer number.We present it by using C and MATLAB programs.The numerical analysis shows the effectiveness of the genetic algorithm in practice.

Key words: prüfer number, Genetic Algorithm(GA), Minimum Spanning Tree(MST), degree-constrained