广东工业大学学报Issue(1)：46-50,5.DOI:10.3969/j.issn.1007-7162.2014.01.009
基于最优变异的万有引力算法
The Gravitational Algorithm Based on the Optimal Mutation
摘要
Abstract
Considering the low convergence speed of the standard gravitational algorithm , and its being stalled easily in the evolutionary process , it proposes the gravitational algorithm , based on the optimal mutation .A mutation operator was introduced , which made it possible for the algorithm to escape from lo-cal optima , thus accelerating the convergence speed .A constraint handling mechanism was proposed for the infeasible mass after mutation .The simulation results show that the new algorithm not only has better ability of optimization , but also improves to some extent the stability .It is an effective algorithm .关键词
万有引力算法/变异/搜索Key words
gravitational algorithm/mutation/search分类
信息技术与安全科学引用本文复制引用
徐怀祥,刘伟..基于最优变异的万有引力算法[J].广东工业大学学报,2014,(1):46-50,5.基金项目
国家自然科学基金资助项目 （）
