IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Analytics on Fireworks Algorithm Solving Problems with Shifts in the Decision Space and Objective Space

Analytics on Fireworks Algorithm Solving Problems with Shifts in the Decision Space and Objective Space
View Sample PDF
Author(s): Shi Cheng (University of Nottingham Ningbo, China), Quande Qin (Shenzhen University, China), Junfeng Chen (Hohai University, China), Yuhui Shi (Xi'an Jiaotong-Liverpool University, China) and Qingyu Zhang (Shenzhen University, China)
Copyright: 2017
Pages: 31
Source title: Nature-Inspired Computing: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-5225-0788-8.ch038

Purchase

View Analytics on Fireworks Algorithm Solving Problems with Shifts in the Decision Space and Objective Space on the publisher's website for pricing and purchasing information.

Abstract

Fireworks algorithms for solving problems with the optima shift in decision space and/or objective space are analyzed in this paper. The standard benchmark problems have several weaknesses in the research of swarm intelligence algorithms for solving single objective problems. The optimum is in the center of search range, and is the same at each dimension of the search space. The optimum shift in decision space and/or objective space could increase the difficulty of problem solving. A mapping strategy, modular arithmetic mapping, is utilized in the original fireworks algorithm to handle solutions out of search range. The solutions are implicitly guided to the center of search range for problems with symmetrical search range via this strategy. The optimization performance of fireworks algorithm on shift functions may be affected by this strategy. Four kinds of mapping strategies, which include mapping by modular arithmetic, mapping to the boundary, mapping to stochastic region, and mapping to limited stochastic region, are compared on problems with different dimensions and different optimum shift range. From experimental results, the fireworks algorithms with mapping to the boundary, or mapping to limited stochastic region obtain good performance on problems with the optimum shift. This is probably because the search tendency is kept in these two strategies. The definition of population diversity measurement is also proposed in this paper, from observation on population diversity changes, the useful information of fireworks algorithm solving different kinds of problems could be obtained.

Related Content

Mohamed Arezki Mellal. © 2022. 9 pages.
Tahir Cetin Akinci, Ramazan Caglar, Gokhan Erdemir, Aydin Tarik Zengin, Serhat Seker. © 2022. 11 pages.
Sunanda Hazra, Provas Kumar Roy. © 2022. 16 pages.
Ragab A. El-Sehiemy, Almoataz Y. Abdelaziz. © 2022. 23 pages.
Khaled Dassa, Abdelmadjid Recioui. © 2022. 35 pages.
Anupama Kumari, Mukund Madhaw, C. B. Majumder, Amit Arora. © 2022. 21 pages.
Mandrita Mondal. © 2022. 20 pages.
Body Bottom