烟花爆炸优化算法

曹炬,贾红,李婷婷

doi:10.3969/j.issn.1007130X.2011.

计算机工程与科学 >

2011 , Vol. 33 >Issue 1: 138 - 142

DOI: https://doi.org/10.3969/j.issn.1007130X.2011.

论文

烟花爆炸优化算法

展开

（华中科技大学数学与统计学院,湖北武汉 430074）

曹炬(1955),男,湖南长沙人,博士，教授，研究方向为优化理论、智能算法及应用。贾红(1985),女,湖北黄冈人，硕士，研究方向为优化理论、智能算法及应用。李婷婷(1986),女,河南开封人，硕士，研究方向为优化理论、智能算法及应用。

收稿日期: 2009-11-10

修回日期: 2010-04-12

网络出版日期: 2011-01-25

收起

A Fireworks Explosion Optimization Algorithm

Expand

(School of Mathematics and Statistics，Huazhong University of Science and Technology，Wuhan 430074,China)

Received date: 2009-11-10

Revised date: 2010-04-12

Online published: 2011-01-25

Fold

摘要

本文受烟花爆炸现象启发，提出一种新的并行弥漫式搜索的优化算法（FEO），为解决优化问题提供了一种新的基础算法。该算法在搜索空间中生成一定数目的烟花弹，对每个烟花弹执行爆炸操作，使得爆炸产生的大量火星形成在原烟花弹（炸点）的一定邻域范围内，并采用局部保优的策略逐代控制进行爆炸的烟花弹数。同时，通过调整烟花弹爆炸的最大半径，可以均衡算法的全局探索和局部搜索能力。为了研究FEO算法的性能，文中对一些标准的测试函数进行了验证。大量的实验结果表明，FEO算法具有快速的收敛过程和高精度的寻优能力，并且稳定性好，过程简单，易于实现。

关键词： 进化算法; 烟花爆炸; 并行搜索; 爆炸半径; 无约束优化

本文引用格式

曹炬,贾红,李婷婷 . 烟花爆炸优化算法[J]. 计算机工程与科学, 2011 , 33(1) : 138 -142 . DOI: 10.3969/j.issn.1007130X.2011.

Abstract

This paper introduces a novel fireworks explosion optimization (FEO) algorithm based on the idea of fireworks explosion .FEO generates a certain number of fireworks bombs in the search space, and each fireworks bomb enforces the operation of explosion, which can ensure plentiful sparks to explore in the neighborhood of the original fireworks bomb. Besides, FEO controls the number of fireworks bombs that perform explosive operations by adopting the partial retention of excellence strategy .Meanwhile, FEO can balance the capability of global exploration and local search by adjusting the maximum radius of the explosion. The proposed algorithm is tested on several benchmark functions. Plentiful experimental results indicate that FEO attains better performance of convergence and highprecision optimization with good stabilization. Moreover, it is simple and easy to achieve the process of FEO.

Key words： evolutionary algorithm;fireworks explosion;parallel search;explosion radius;unconstrained optimization

参考文献

［1］Havens T C, Spain C J,Salmon N G.Roach Infestation Optimization［C］∥Proc of the SIS 2008 Swarm Intelligence Symp, 2008:17.
［2］Forrest S. Genetic Algorithm: Principles of Natural Selection Applied to Computation［J］. Science, 1993,261:872878.
［3］Kennedy J, Eberhart R C. Particle Swarm Optimization［C］∥Proc of the IEEE Int’l Conf on Neural Networks,1995:19421948.
［4］Chelouah R, Siarry P. A Continuous Genetic Algorithm Designed for the Global Optimization of Multimodal Functions［J］.Journal of Heuristics,2000,6(2):191213.
［5］Chelouah R, Siarry P.A Hybrid Method Combining Continuous Tabu Search and NelderMead Simples Algorithms for the Global Optimization of Multiminima Functions［J］.European Journal of Operational Research,2005,161:636654.
［6］Chelouah R, Siarry P. Genetic and NelderMead AlgorithmsHybridized for a More Accurate Global Optimization of Continuous Multiminima Functions［J］.European Journal of Operational Research,2003,148:248335.
［7］Kao Y T, Zahara E. A Hybrid Genetic Algorithm and Particle Swarm Optimization for Multimodal Functions［J］.Applied Soft Computing, 2008,8(2):849857.
［8］Fan S K, Liang Y C, Zahara E.Hybrid Simplex Search and Particle Swarm Optimization for the Global Optimization of Multimodal Functions［J］.Eng Optim, 2004,36:401418.
［9］Zhang Changsheng, Ning Jiaxu, Lu Shuai. A Novel Hybrid Differential Evolution and Particle Swarm Optimization Algorithm for Unconstrained Optimization［J］.Operations Research Letters,2009,37(2):117122.
［10］Jiang Yan, Hu Tiesong, Huang Chongchao. A Shuffled Complex Evolution of Particle Swarm Optimization Algorithm［C］∥Proc of ICANNGA’07, 2007:341349.

Options

文章导航

模态框（Modal）标题

摘要

本文引用格式

Abstract

参考文献