返回
Pelican Optimization Algorithm: A Novel Nature-Inspired Algorithm for Engineering Applications
DOI:10.3390/s22030855.png)
摘要
En 中文
Optimization is an important and fundamental challenge to solve optimization problems in different scientific disciplines. In this paper, a new stochastic nature-inspired optimization algorithm called Pelican Optimization Algorithm (POA) is introduced. The main idea in designing the proposed POA is simulation of the natural behavior of pelicans during hunting. In POA, search agents are pelicans that search for food sources. The mathematical model of the POA is presented for use in solving optimization issues. The performance of POA is evaluated on twenty-three objective functions of different unimodal and multimodal types. The optimization results of unimodal functions show the high exploitation ability of POA to approach the optimal solution while the optimization results of multimodal functions indicate the high ability of POA exploration to find the main optimal area of the search space. Moreover, four engineering design issues are employed for estimating the efficacy of the POA in optimizing real-world applications. The findings of POA are compared with eight well-known metaheuristic algorithms to assess its competence in optimization. The simulation results and their analysis show that POA has a better and more competitive performance via striking a proportional balance between exploration and exploitation compared to eight competitor algorithms in providing optimal solutions for optimization problems.
Keyword:
optimization
nature inspired
swarm intelligence
optimization problem
pelican
population-based algorithm
stochastic
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
Rational cultivation promotes the sustainable development of peanut production in Shandong合理栽培促进山东省花生生产的可持续发展
Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems阿基米德优化算法: 解决优化问题的一种新的元启发式算法
APPLIED INTELLIGENCE
IF3.5

