A Heuristic Genetic Search Algorithm for Solving the Degree-Constrained Minimum Spanning Tree Problem
求解度限制最小生成树问题的启发式遗传搜索算法

We propose a heuristic genetic search algorithm for solving the degree\|constrained minimum spanning tree problem. The feasibility of the algorithm is illustrated by amount of numeric experiments. Finally, the extent of the algorithm is expanded properly. We also present the details and some examples of solving the travelling salesman problems and the multiple travelling salesman problems with this algorithm.