%0 Journal Article
%T A Heuristic Genetic Search Algorithm for Solving the Degree-Constrained Minimum Spanning Tree Problem<br>求解度限制最小生成树问题的启发式遗传搜索算法
%A WANG Li
%A |cheng
%A SUN Lin
%A |ping
%A <br>王励成
%A 孙麟平
%J 系统工程理论与实践
%D 2003
%I 
%X 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.
%K genetic algorithm
%K heuristic search
%K degree\|constrained minimum spanning tree<br>遗传算法
%K 启发式搜索
%K 度限制最小生成树
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=C3A7843AA37D8465&yid=D43C4A19B2EE3C0A&vid=EA389574707BDED3&iid=94C357A881DFC066&sid=89F76E117E9BDB76&eid=D767283A3B658885&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=4&reference_num=10