.png){kind=icon}
Return
A novel bat algorithm with dynamic membrane structure for optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-020-01898-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To improve the optimization efficiency for different optimization problems and take advantage of the dynamic membrane computing framework, this paper proposes an improved bat algorithm, namely, Dynamic Membrane-driven Bat Algorithm (DMBA). The dynamic construction of the DMBA algorithm aims at enhancing population diversity by balancing the exploration-exploitation tradeoff. Unlike the static membrane algorithms, the membranes in DMBA will be dynamically evolved by using merging and separation rules which help in maintaining the diversity of the population. The experimental results on a set of well-known benchmark functions including CEC 2005, CEC 2011, and CEC 2017 clearly prove the effectiveness of the proposed DMBA algorithm in terms of maintaining the diversity and exploitation capabilities compared to that of the others. It is shown that the proposed DMBA algorithm is superior to recent variants of the bat algorithm and other well-known algorithms in terms of solution accuracy and convergence speed.
Keywords:
Dynamic membrane structure
Parallel membrane framework
Bat algorithm
Optimization problems
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.6K
Citations:
1.7W
Organization
Cited Papers
ShareSave
ShareSaveResistance of the insulin crystal to lysosomal proteases: implications for pancreatic B-cell crinophagy.png)
Diabetologia
OAAI
DiabetologiaIF0
OAAIShareSaveShareSaveShareSave
View more