[Zhou, Kang; Ge, Shuangqi; Hu, Di; Dai, Peng] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
通讯机构：
[Hu, Di] W
Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
语种：
英文
关键词：
Particle Swarm Optimization;Minimum spanning tree of length constraint problem;Spanning tree
期刊：
PROCEEDINGS OF 8TH INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTATION TECHNOLOGY AND AUTOMATION (ICICTA 2015)
ISSN：
1949-1263
年：
2015
页码：
474-477
会议名称：
8th International Conference on Intelligent Computation Technology and Automation (ICICTA)
会议论文集名称：
International Conference on Intelligent Computation Technology and Automation
会议时间：
JUN 14-15, 2015
会议地点：
Nanchang, PEOPLES R CHINA
会议主办单位：
[Hu, Di;Dai, Peng;Zhou, Kang;Ge, Shuangqi] Wuhan Polytech Univ, Sch Math & Comp, Wuhan, Peoples R China.
会议赞助商：
Changsha Univ Sci & Technol, Commun Res Inst, Hunan City Coll, Dept Urban Management, Hong Kong Intelligent Computat Technol & Automat Assoc, Central S Univ, Shenzhen Res Inst
National Natural Science Foundation of ChinaNational Natural Science Foundation of China (NSFC) [61179032, 11301405]
机构署名：
本校为第一且通讯机构
院系归属：
数学与计算机学院
摘要：
Minimum spanning tree of length constraint problem (MSTLCP) can not be solved by traditional algorithms, so improved Particle Swarm Optimization (PSO) is put forward to solve MSTLCP, based on the idea of global and feasible searching. In the improved PSO, introducing check function ensures the feasibility of particle swarm; more reasonable fitness function is designed based on the relationship between spanning tree and its cotree; improvements for updating the position of particle make the current position of particle be beneficial to being close to the best position of particle in its neighbo...
