z-logo
Premium
Adaptive FA based on evaluation and control of search state for superior solution set search problem
Author(s) -
Wang Hongran,
Tamura Kenichi,
Tsuchiya Junichi,
Yasuda Keiichiro
Publication year - 2018
Publication title -
ieej transactions on electrical and electronic engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.254
H-Index - 30
eISSN - 1931-4981
pISSN - 1931-4973
DOI - 10.1002/tee.22741
Subject(s) - metaheuristic , mathematical optimization , firefly algorithm , benchmark (surveying) , set (abstract data type) , local search (optimization) , computer science , guided local search , search algorithm , beam search , mathematics , particle swarm optimization , geodesy , programming language , geography
In conventional single‐objective optimization, presenting multiple alternatives is difficult because the aim is to search for only one global optimal or suboptimal solution. In this paper, we propose a superior solution set search problem as an optimization problem to simultaneously find multiple excellent solutions in multimodal functions. In addition, we analyze the characteristics of the Firefly Algorithm (FA), which divides the search process into multiple clusters, and using this property, we efficiently search for the superior solution set. We interpret the metaheuristics strategy (i.e., diversification and intensification) of the superior solution set search problem and clarify the effects of parameters on the cluster search dynamics of FA in terms of the metaheuristics strategy. After the above analysis, we propose an adaptive FA that preliminarily performs parameter adjustment according to set target value schedule, evaluate indicators of diversification and intensification for the superior solution set search problem, and verify their usefulness by conducting a numerical experiment using three typical benchmark functions. © 2018 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here