Explosion Operation of Fireworks Algorithm

Explosion Operation of Fireworks Algorithm

Jun Yu, Hideyuki Takagi
DOI: 10.4018/978-1-7998-1659-1.ch003
OnDemand:
(Individual Chapters)
Available
$33.75
List Price: $37.50
10% Discount:-$3.75
TOTAL SAVINGS: $3.75

Abstract

This chapter briefly reviews the basic explosion mechanism used in the fireworks algorithm (FWA) and comprehensively investigates relevant research on explosion operations. Since the explosion mechanism is one of the most core operations directly affecting the performance of FWA, the authors focus on analyzing the FWA explosion operation and highlighting two novel explosion strategies: a multi-layer explosion strategy and a scouting explosion strategy. The multi-layer explosion strategy allows an individual firework to perform multiple explosions instead of the single explosion used in the original FWA, where each round of explosion can be regarded as a layer; the scouting explosion strategy controls an individual firework to generate spark individuals one by one instead of generating all spark individuals within the explosion amplitude at once. The authors then introduce several other effective strategies to further improve the performance of FWA by full using the information generated by the explosion operation. Finally, the authors list some open topics for discussion.
Chapter Preview
Top

Introduction

The fireworks algorithm (FWA) (Tan & Zhu, 2014) is a population-based meta-heuristic optimization algorithm that simulates the explosion process of real fireworks repeatedly in order to find the global optimum. Although it is a young member of the family of algorithms in the evolutionary computation (EC) community, it attracts a lot of attention from practitioners owing to its huge potential due to its e.g. ease of use, robustness, efficiency, parallelism, and other characteristics. With the rapid increase in its popularity and real-world applications, development of FWA is booming and it has become an important branch in EC algorithms.

Since the basic FWA was first proposed in 2010, researchers have frequently proposed many effective strategies to further improve its performance. For example, Zheng et al. modified five operations used in FWA to develop a more efficient version, enhanced FWA (EFWA) (Zheng, 2013). Yu et al. used the explosion information to calculate a convergence point that has a high possibility to locate in the global optimal area and used it as an elite individual to accelerate the convergence of FWA (Yu, Tan & Takagi, 2018). Pei et al. adopted different sampling methods to approximate the fitness landscape to accelerate the FWA search (Pei, 2012). Some work focuses on developing powerful hybrid algorithms by introducing operations from other EC algorithms into FWA to inherit their strengths, such as differential mutation (Yu & Kelley, 2014), covariance mutation (Yu & Tan, 2015), the gravitational search operator (Zhu, 2016), chaotic systems (Gong, 2016), and the firefly algorithm (Wang, 2019). Additionally, FWA has also been applied to solve various types of optimization problems, such as multimodal optimization (Yu, 2019), multi-objective optimization (Zhan, 2018), constrained optimization (Bacanin, 2015), dynamic optimization (Pekdemir, 2016), and large-scale optimization (Pandey, 2018).

Complete Chapter List

Search this Book:
Reset