arrow
返回

Enhanced migrating birds optimization algorithm for optimization problems in different domains

delete2024-05-21
delete1
delete
OA
AI
R
Ramazan Algin *
A
Ali Fuat Alkaya
M
Mustafa Agaoğlu
DOI:10.1007/s10479-024-05992-9delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Migrating birds optimization algorithm is a promising metaheuristic algorithm recently introduced to the optimization community. In this study, we propose a superior version of the migrating birds optimization algorithm by hybridizing it with the simulated annealing algorithm which is one of the most popular metaheuristics. The new algorithm, called MBOx, is compared with the original migrating birds optimization and four well-known metaheuristics, including the simulated annealing, differential evolution, genetic algorithm and recently proposed harris hawks optimization algorithm. The extensive experiments are conducted on problem instances from both discrete and continuous domains; feature selection problem, obstacle neutralization problem, quadratic assignment problem and continuous functions. On problems from discrete domain, MBOx outperforms the original MBO and others by up to 20.99%. On the continuous functions, it is observed that MBOx does not lead the competition but takes the second position. As a result, MBOx provides a significant performance improvement and therefore, it is a promising solver for computational optimization problems.
Keyword:
Metaheuristics
Migrating birds optimization
Feature selection
Quadratic assignment problem
Obstacle neutralization problem
Continuous functions

期刊

Annals of Operations Research 封面图
Annals of Operations Research
IF:
4.5
论文数:
8.0K
被引数:
2.1W

机构

M
Marmara University
学者数:
6.2K
论文数: 4.6K
被引数: 4.1K
引用论文

引用论文

SGOA: annealing-behaved grasshopper optimizer for global tasks
err2021-01-03
err111
PREAI
errYu, Caiyang; Chen, Mengxiang; Cheng, Kai; Zhao, Xuehua; Ma, Chao; Kuang, Fangjun; Chen, Huiling
err分享
err收藏
err分享
err收藏
学者 查看更多内容