基于改进遗传算法的最小生成树算法

以图论和改进遗传算法为基础，提出了一种求最小生成树的遗传算法。该算法采用二进制表示最小树问题，并设计出相应的适应度函数、算子以及几种控制策略，以提高执行速度和进化效率。传统算法一次只能得到一个候选解。用该算法对其求解，可以在较短的时间内以较高的概率获得多个候选解。应用实例表明该算法优于传统算法。

Minimum spanning tree algorithms based on improved genetic algorithms

Based on the graphic theory and improved genetic algorithm, an improved genetic algorithm to search the minimum spanningtrees is given. The algorithm uses binary code to represent the problem of minimum spanning trees. It designs the corresponding fitnessfunction, operator and few controlling strategies to improve its speed and evolutionary efficiency Only one solution can be gotten withrunning traditional algorithem at one time. The new algorithm can get a set of the solutions with higher probability in a shorter time. Theexperiment shows that it has a better performance than traditional methods.