@Article{cmc.2022.019867,
AUTHOR = {Fatemeh Ahmadi Zeidabadi, Sajjad Amiri Doumari, Mohammad Dehghani, Zeinab Montazeri, Pavel Trojovský, Gaurav Dhiman},
TITLE = {AMBO: All Members-Based Optimizer for Solving Optimization Problems},
JOURNAL = {Computers, Materials \& Continua},
VOLUME = {70},
YEAR = {2022},
NUMBER = {2},
PAGES = {2905--2921},
URL = {http://www.techscience.com/cmc/v70n2/44661},
ISSN = {1546-2226},
ABSTRACT = {There are many optimization problems in different branches of science that should be solved using an appropriate methodology. Population-based optimization algorithms are one of the most efficient approaches to solve this type of problems. In this paper, a new optimization algorithm called All Members-Based Optimizer (AMBO) is introduced to solve various optimization problems. The main idea in designing the proposed AMBO algorithm is to use more information from the population members of the algorithm instead of just a few specific members (such as best member and worst member) to update the population matrix. Therefore, in AMBO, any member of the population can play a role in updating the population matrix. The theory of AMBO is described and then mathematically modeled for implementation on optimization problems. The performance of the proposed algorithm is evaluated on a set of twenty-three standard objective functions, which belong to three different categories: unimodal, high-dimensional multimodal, and fixed-dimensional multimodal functions. In order to analyze and compare the optimization results for the mentioned objective functions obtained by AMBO, eight other well-known algorithms have been also implemented. The optimization results demonstrate the ability of AMBO to solve various optimization problems. Also, comparison and analysis of the results show that AMBO is superior and more competitive than the other mentioned algorithms in providing suitable solution.},
DOI = {10.32604/cmc.2022.019867}
}