.png){kind=icon}
Return
Exponential distribution optimizer (EDO): a novel math-inspired algorithm for global optimization and engineering problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10462-023-10403-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Numerous optimization problems can be addressed using metaheuristics instead of deterministic and heuristic approaches. This study proposes a novel population-based metaheuristic algorithm called the Exponential Distribution Optimizer (EDO). The main inspiration for EDO comes from mathematics based on the exponential probability distribution model. At the outset, we initialize a population of random solutions representing multiple exponential distribution models. The positions in each solution represent the exponential random variables. The proposed algorithm includes two methodologies for exploitation and exploration strategies. For the exploitation stage, the algorithm utilizes three main concepts, memoryless property, guiding solution and the exponential variance among the exponential random variables to update the current solutions. To simulate the memoryless property, we assume that the original population contains only the winners that obtain good fitness. We construct another matrix known as memoryless to retain the newly generated solutions regardless of their fitness compared to their corresponding winners in the original population. As a result, the memoryless matrix stores two types of solutions: winners and losers. According to the memoryless property, we disregard and do not memorize the previous history of these solutions because past failures are independent and have no influence on the future. The losers can thus contribute to updating the new solutions next time. We select two solutions from the original population derived from the exponential distributions to update the new solution throughout the exploration phase. Furthermore, EDO is tested against classical test functions in addition to the Congress on Evolutionary Computation (CEC) 2014, CEC 2017, CEC 2020 and CEC 2022 benchmarks, as well as six engineering design problems. EDO is compared with the winners of CEC 2014, CEC 2017 and CEC 2020, which are L-SHADE, LSHADE-cnEpSin and AGSK, respectively. EDO reveals exciting results and can be a robust tool for CEC competitions. Statistical analysis demonstrates the superiority of the proposed EDO at a 95% confidence interval.
Keywords:
Swarm intelligence
Exponential distribution optimizer algorithm
Memoryless property
Stochastic
Engineering design problem
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more