期刊文献+

基于亲和度的引力移动算法

Improved gravitation move algorithm based on affinity
下载PDF
导出
摘要 为提高引力移动算法搜索性能,针对引力移动算法解决一些高维空间优化问题时存在的收敛速度慢、搜索精度不高的问题,提出一种基于亲和度的改进引力移动算法PGMA。基于引力移动算法原理,通过构造一个基于亲和度概念的系数对种群个体受到的引力合力公式作适当的变换改造基本引力移动算法。改进后的算法对种群中个体的位置更新方向加以引导,来提高算法的搜索精度和算法搜索能力。用13个基准函数对改进算法进行试验验证改进算法在求解精度和稳定性上优于基本引力移动算法。 To improve the searching performance of gravitation move algorithm, in accordance with problems of bad performance 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.
出处 《计算机工程与应用》 CSCD 北大核心 2018年第6期44-48,共5页 Computer Engineering and Applications
基金 天津市科技计划项目(No.16JCTPJC47400)
关键词 引力移动算法 合力 亲和度 基准函数 可调参数 Gravitation Move Algorithm(GMA) resultant force affinity benchmark function adjustable parameter
  • 相关文献

参考文献7

二级参考文献115

  • 1王平,童颙,李国柱,陈星莺.基于分布式结构的电压无功协调控制系统[J].江苏电机工程,2006,25(4):15-17. 被引量:2
  • 2周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2):113-124. 被引量:210
  • 3汪洋,苏义荣,张少杰,刘政,吴福保.一种适用于地县级电网的电压无功结合控制模式[J].江苏电机工程,2007,26(2):40-43. 被引量:4
  • 4CROCE F D, NARAYAN V, TADEI R. The two-machine total completion time flow shop problem[ J]. European Journal of Operational Research, 1996, 90 : 227-237. 被引量:1
  • 5CROCE F D, GHIRARDI M, TADEI R. An improved branch-and-bound algorithm for the two machine total completion time flow shop problem [ J ]. European Journal of Operational Research, 2002, 139: 293-301. 被引量:1
  • 6PALMER D S. Sequencing jobs through a multistage process in the minimum total time: a quick method of obtaining a near-optimum [ J ]. Operational Research Quarterly, 1965, 16: 101-107. 被引量:1
  • 7GUPTA J N D. Heuristic algorithms for multistage flowshop scheduling problem [ J ]. AIIE Transactions, 1972, 4 : 11- 18. 被引量:1
  • 8KUO Ihong, HORNG Shijinn, KAO Tzongwann, et al. An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model [ J ]. Lecture Notes in Computer Science, 2007, 4570: 303-312. 被引量:1
  • 9LIAN Zhigang, GU Xingsheng, JIAO Bin. A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan [ J ]. Chaos, Solitons and Fractals, 2008, 35: 851-86I. 被引量:1
  • 10RASHEDI E, NEZAMABADI-POUR H, SARYAZDI S. GSA: a gravitational search algorithm[J]. Information Science, 2009, 179(13) : 2232-2248. 被引量:1

共引文献81

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部