计算机工程与应用2018，Vol.54Issue(6)：44-48,5.DOI:10.3778/j.issn.1002-8331.1611-0158
基于亲和度的引力移动算法
Improved gravitation move algorithm based on affinity
摘要
Abstract
To improve the searching performance of gravitation move algorithm,in accordance with problems of bad per-formance in search accuracy and slow convergence speed in the high dimensional space optimization,PGMA is proposed by introducing affinity to improve the algorithm convergence and search precision,and this improved Gravitational Move Algorithm(GMA)changes the particle's gravitational force calculation formula.It includes the principles of gravitational move algorithm and the structure of the affinity,and the affinity for the appropriate transformation is added to the formula resultant force.Then the formula resultant force is modified.Thirteen benchmarks function are tested and show that new algorithm is better than GMA with both a steady convergence and a better accuracy of solution.关键词
引力移动算法/合力/亲和度/基准函数/可调参数Key words
Gravitation Move Algorithm(GMA)/resultant force/affinity/benchmark function/adjustable parameter分类
信息技术与安全科学引用本文复制引用
赵蕊娟,杨连贺..基于亲和度的引力移动算法[J].计算机工程与应用,2018,54(6):44-48,5.基金项目
天津市科技计划项目(No.16JCTPJC47400). （No.16JCTPJC47400）
