A scattering and repulsive swarm intelligence algorithm for solving global optimization problems

Diptangshu Pandit, Li Zhang, Samiran Chattopadhyay, Chee Peng Lim, Liu Chengyu

Research output: Contribution to journalArticleResearchpeer-review

29 Downloads (Pure)

Abstract

The firefly algorithm (FA), as a metaheuristic search method, is useful for solving diverse optimization problems. However, it is challenging to use FA in tackling high dimensional optimization problems, and the random movement of FA has a high likelihood to be trapped in local optima. In this research, we propose three improved algorithms, i.e., Repulsive Firefly Algorithm (RFA), Scattering Repulsive Firefly Algorithm (SRFA), and Enhanced SRFA (ESRFA), to mitigate the premature convergence problem of the original FA model. RFA adopts a repulsive force strategy to accelerate fireflies (i.e. solutions) to move away from unpromising search regions, in order to reach global optimality in fewer iterations. SRFA employs a scattering mechanism along with the repulsive force strategy to divert weak neighbouring solutions to new search regions, in order to increase global exploration. Motivated by the survival tactics of hawk-moths, ESRFA incorporates a hovering-driven attractiveness operation, an exploration-driven evading mechanism, and a learning scheme based on the historical best experience in the neighbourhood to further enhance SRFA. Standard and CEC2014 benchmark optimization functions are used for evaluation of the proposed FA-based models. The empirical results indicate that ESRFA, SRFA and RFA significantly outperform the original FA model, a number of state-of-the-art FA variants, and other swarm-based algorithms, which include Simulated Annealing, Cuckoo Search, Particle Swarm, Bat Swarm, Dragonfly, and Ant-Lion Optimization, in diverse challenging benchmark functions.
Original languageEnglish
Pages (from-to)12-42
Number of pages31
JournalKnowledge-Based Systems
Volume156
Early online date26 May 2018
DOIs
Publication statusPublished - 15 Sep 2018

Fingerprint

Global optimization
Scattering
Swarm intelligence
Simulated annealing

Cite this

Pandit, Diptangshu ; Zhang, Li ; Chattopadhyay, Samiran ; Lim, Chee Peng ; Chengyu, Liu. / A scattering and repulsive swarm intelligence algorithm for solving global optimization problems. In: Knowledge-Based Systems. 2018 ; Vol. 156. pp. 12-42.
@article{32bd64dc45fe4a9a8d6c637a33e5e153,
title = "A scattering and repulsive swarm intelligence algorithm for solving global optimization problems",
abstract = "The firefly algorithm (FA), as a metaheuristic search method, is useful for solving diverse optimization problems. However, it is challenging to use FA in tackling high dimensional optimization problems, and the random movement of FA has a high likelihood to be trapped in local optima. In this research, we propose three improved algorithms, i.e., Repulsive Firefly Algorithm (RFA), Scattering Repulsive Firefly Algorithm (SRFA), and Enhanced SRFA (ESRFA), to mitigate the premature convergence problem of the original FA model. RFA adopts a repulsive force strategy to accelerate fireflies (i.e. solutions) to move away from unpromising search regions, in order to reach global optimality in fewer iterations. SRFA employs a scattering mechanism along with the repulsive force strategy to divert weak neighbouring solutions to new search regions, in order to increase global exploration. Motivated by the survival tactics of hawk-moths, ESRFA incorporates a hovering-driven attractiveness operation, an exploration-driven evading mechanism, and a learning scheme based on the historical best experience in the neighbourhood to further enhance SRFA. Standard and CEC2014 benchmark optimization functions are used for evaluation of the proposed FA-based models. The empirical results indicate that ESRFA, SRFA and RFA significantly outperform the original FA model, a number of state-of-the-art FA variants, and other swarm-based algorithms, which include Simulated Annealing, Cuckoo Search, Particle Swarm, Bat Swarm, Dragonfly, and Ant-Lion Optimization, in diverse challenging benchmark functions.",
author = "Diptangshu Pandit and Li Zhang and Samiran Chattopadhyay and Lim, {Chee Peng} and Liu Chengyu",
year = "2018",
month = "9",
day = "15",
doi = "10.1016/j.knosys.2018.05.002",
language = "English",
volume = "156",
pages = "12--42",
journal = "Knowledge-Based Systems",
issn = "0950-7051",
publisher = "Elsevier",

}

A scattering and repulsive swarm intelligence algorithm for solving global optimization problems. / Pandit, Diptangshu; Zhang, Li; Chattopadhyay, Samiran; Lim, Chee Peng; Chengyu, Liu.

In: Knowledge-Based Systems, Vol. 156, 15.09.2018, p. 12-42.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - A scattering and repulsive swarm intelligence algorithm for solving global optimization problems

AU - Pandit, Diptangshu

AU - Zhang, Li

AU - Chattopadhyay, Samiran

AU - Lim, Chee Peng

AU - Chengyu, Liu

PY - 2018/9/15

Y1 - 2018/9/15

N2 - The firefly algorithm (FA), as a metaheuristic search method, is useful for solving diverse optimization problems. However, it is challenging to use FA in tackling high dimensional optimization problems, and the random movement of FA has a high likelihood to be trapped in local optima. In this research, we propose three improved algorithms, i.e., Repulsive Firefly Algorithm (RFA), Scattering Repulsive Firefly Algorithm (SRFA), and Enhanced SRFA (ESRFA), to mitigate the premature convergence problem of the original FA model. RFA adopts a repulsive force strategy to accelerate fireflies (i.e. solutions) to move away from unpromising search regions, in order to reach global optimality in fewer iterations. SRFA employs a scattering mechanism along with the repulsive force strategy to divert weak neighbouring solutions to new search regions, in order to increase global exploration. Motivated by the survival tactics of hawk-moths, ESRFA incorporates a hovering-driven attractiveness operation, an exploration-driven evading mechanism, and a learning scheme based on the historical best experience in the neighbourhood to further enhance SRFA. Standard and CEC2014 benchmark optimization functions are used for evaluation of the proposed FA-based models. The empirical results indicate that ESRFA, SRFA and RFA significantly outperform the original FA model, a number of state-of-the-art FA variants, and other swarm-based algorithms, which include Simulated Annealing, Cuckoo Search, Particle Swarm, Bat Swarm, Dragonfly, and Ant-Lion Optimization, in diverse challenging benchmark functions.

AB - The firefly algorithm (FA), as a metaheuristic search method, is useful for solving diverse optimization problems. However, it is challenging to use FA in tackling high dimensional optimization problems, and the random movement of FA has a high likelihood to be trapped in local optima. In this research, we propose three improved algorithms, i.e., Repulsive Firefly Algorithm (RFA), Scattering Repulsive Firefly Algorithm (SRFA), and Enhanced SRFA (ESRFA), to mitigate the premature convergence problem of the original FA model. RFA adopts a repulsive force strategy to accelerate fireflies (i.e. solutions) to move away from unpromising search regions, in order to reach global optimality in fewer iterations. SRFA employs a scattering mechanism along with the repulsive force strategy to divert weak neighbouring solutions to new search regions, in order to increase global exploration. Motivated by the survival tactics of hawk-moths, ESRFA incorporates a hovering-driven attractiveness operation, an exploration-driven evading mechanism, and a learning scheme based on the historical best experience in the neighbourhood to further enhance SRFA. Standard and CEC2014 benchmark optimization functions are used for evaluation of the proposed FA-based models. The empirical results indicate that ESRFA, SRFA and RFA significantly outperform the original FA model, a number of state-of-the-art FA variants, and other swarm-based algorithms, which include Simulated Annealing, Cuckoo Search, Particle Swarm, Bat Swarm, Dragonfly, and Ant-Lion Optimization, in diverse challenging benchmark functions.

U2 - 10.1016/j.knosys.2018.05.002

DO - 10.1016/j.knosys.2018.05.002

M3 - Article

VL - 156

SP - 12

EP - 42

JO - Knowledge-Based Systems

JF - Knowledge-Based Systems

SN - 0950-7051

ER -