返回
Golden Search Optimization Algorithm
DOI:10.1109/ACCESS.2022.3162853.png)
摘要
En 中文
This study introduces an effective population-based optimization algorithm, namely the Golden Search Optimization Algorithm (GSO), for numerical function optimization. The new algorithm has a simple but effective strategy for solving complex problems. GSO starts with random possible solutions called objects, which interact with each other based on a simple mathematical model to reach the global optimum. To provide a fine balance between the explorative and exploitative behavior of a search, the proposed method utilizes a transfer operator in the adaptive step size adjustment scheme. The proposed algorithm is benchmarked with 23 unimodal, multimodal, and fixed dimensional functions and the results are verified by a comparative study with the well-known Gravitational Search Algorithm (GSA), Sine-Cosine Algorithm (SCA), Grey Wolf Optimization (GWO), and Tunicate Swarm Algorithm (TSA). In addition, the nonparametric Wilcoxon's rank sum test is performed to measure the pair-wise statistical performance of the GSO and provide a valid judgment about the performance of the algorithm. The simulation results demonstrate that GSO is superior and could generate better optimal solutions when compared with other competitive algorithms.
Keyword:
Optimization
Metaheuristics
Particle swarm optimization
Search problems
Heuristic algorithms
Genetic algorithms
Statistics
Global optimization
golden search
metaheuristic
population-based
benchmark function
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Kinematic and kinetic differences in the execution of vertical jumps between people with good and poor ankle joint dorsiflexion踝关节背屈良好和不良的人在执行垂直跳跃时的运动学和动力学差异
Chameleon Swarm Algorithm: A bio-inspired optimizer for solving engineering design problems变色龙群算法: 解决工程设计问题的生物启发优化器
Purification of Copper Nanowires To Prepare Flexible Transparent Conductive Films with High Performance提纯铜纳米线制备高性能柔性透明导电薄膜


