基于工作集择优保留策略算法  

Better Element Retained Algorithm Based on Working Set

作　　者：葛华[1] 王传安[1] 赵靖[1] 李香云[1] 

机构地区：[1]安徽科技学院理学院,安徽滁州233100

出　　处：《河北北方学院学报（自然科学版）》2012年第6期55-58,共4页Journal of Hebei North University:Natural Science Edition

基　　金：安徽省教育厅优秀青年基金重点项目(2011SQRL117ZD);安徽科技学院引进人才基金资助(ZRC2010255);安徽科技学院青年科学研究基金(ZRC2011273)

摘　　要：通过对工作集元素置换算法研究基础上提出工作集择优保留策略算法。根据工作集的个体元素的贡献度不同将工作集元素划分为优个体、良个体、劣个体。保留最接近最优解的优个体,采用相邻优个体平均数置换良个体,相邻良个体元素平均数置换劣个体。从而达到新产生的工作集个体元素接近最优解并能够快速收敛。通过对4个多维测试函数的算法仿真,表明本算法有效、快速、准确收敛近似最优解。Better element retained algorithm based on the working set is proposed after research of the working set replacement algorithm.The elements are divided into best individuals,good individuals,and inferior individuals according to the contribution of the different individual elements of the working set.By best individual retained,good individual elements replaced by average adjacent best individual elements,and inferior individual elements replaced by average adjacent good individual elements the individual elements of the new working set are fast approaching similar optimal solution convergence.The algorithm simulation of four multi-dimensional test functions show that the algorithm could effectively,rapidly and accurately converge approximate optimal solutions.

关 键 词：工作集 置换 择优保留 贡献度 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]