一种求解度约束最小生成树问题的优化算法-软件学报.PDF

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.21, No.12, December 2010, pp.3068−3081 doi: 10.3724/SP.J.1001.2010.03713 Tel/Fax: +86-10 © by Institute of Software , the Chinese Academy of Sciences . All rights reserved. ∗ 一种求解度约束最小生成树问题的优化算法 + 王竹荣 , 张九龙, 崔杜武 (西安理工大学 计算机科学与工程学院,陕西 西安 710048) Optimization Algorithm for Solving Degree-Constrained Minimum Spanning Tree Problem + WANG Zhu-Rong , ZHANG Jiu-Long, CUI Du-Wu (School of Computer Science and Engineering, Xi’an University of Technology, Xi’an 710048, China) + Corresponding author: E-mail: wangzhurong@ Wang ZR, Zhang JL, Cui DW. Optimization algorithm for solving degree-constrained minimum spanning tree problem. Journal of Software, 2010,21(12):3068−3081. /1000-9825/3713.htm Abstract : To solve the degree-constrained spanning minimum tree (DCMST) problems with a large scale of nodes, an optimization algorithm based on grafting and pruning operator is proposed. Learning from the flower planting techniques, this paper establishes, an evolutionary computation framework containing accelerating and adjusting operators based on conventional genetic operators. The grafting and pruning are performed by a greedy strategy and gain maximization respectively. The collision caused by possible local minima is analyzed and detected, and several methods dealing with the collision are discussed. To tackle the complexity of DCMST problems, some strategies of grafting and pruning are proposed. The convergence of the proposed algorithm and the computation complexity are analyzed. For DCMST problems of Euclidean and uniform rand