| 一种采用聚类单纯形搜索的引力算法 |
| |
| 引用本文： | 刘杰,王宇平. 一种采用聚类单纯形搜索的引力算法[J]. 西安电子科技大学学报(自然科学版), 2014, 41(6): 100-105. DOI: 10.3969/j.issn.1001-2400.2014.06.017 |
| |
| 作者姓名： | 刘杰 王宇平 |
| |
| 作者单位： | (1. 西安电子科技大学 数学与统计学院，陕西 西安710071；2. 西安科技大学 理学院，陕西 西安710054;3. 西安电子科技大学 计算机学院，陕西 西安710071) |
| |
| 基金项目： | 国家自然科学基金资助项目(61272119, 11301414, 11226173) |
| |
| 摘 要： | 提出了一种基于聚类和单纯形法的中心引力优化算法，该算法引入了一种聚类单纯形算子，利用聚类方法选择合适的个体以构成单纯形的顶点，周期性地把单纯形算子搜索得到的最优个体迁移到中心引力算法的种群个体中．依靠聚类单纯形算子提高中心引力算法的局部搜索能力和收敛速度，聚类单纯形算子依靠中心引力算法跳出局部最优．实验结果表明，改进后的算法比其他常见优化算法有更好的收敛精度和收敛速度．
|
| 关 键 词： | 中心引力优化 聚类分析 单纯形 全局优化 |
| 收稿时间： | 2014-02-28 |
Central force optimization algorithm via clustering simplex search |
| |
| LIU Jie,WANG Yuping. Central force optimization algorithm via clustering simplex search[J]. Journal of Xidian University, 2014, 41(6): 100-105. DOI: 10.3969/j.issn.1001-2400.2014.06.017 |
| |
| Authors: | LIU Jie WANG Yuping |
| |
| Affiliation: | (1. School of Mathematics and Statistics, Xidian Univ., Xi'an 710071, China;2. College of Science, Xi'an University of Science and Technology, Xi'an 710054, China;3. School of Computer Science and Technology, Xidian Univ., Xi'an 710071, China) |
| |
| Abstract: | An improved central force optimization (CFO) is proposed based on the clustering and simplex method for global optimization. The clustering simplex (CS) operator is introduced to a new algorithm in the evolution process. Vertices of simplex are selected by clustering methods, and a periodical migrating of the best individual is introduced by the CS operator. CS can get away from local converged points by virtue of CFO, and CFO can improve its local exploiting capability and effectively speed up the convergence under the help of CS. Experimental results show that the proposed hybrid CSCFO algorithm is better than other algorithms in convergent speed and searching precision. |
| |
| Keywords: | central force optimization cluster analysis simplex global optimization |
|
| 点击此处可从《西安电子科技大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《西安电子科技大学学报(自然科学版)》下载全文 |
