改进的多策略融合黑猩猩搜索算法及其应用

ID:39107

阅读量:0

大小:7.55 MB

页数:22页

时间:2023-03-14

金币:2

上传者:战必胜
Citation: Wu, H.; Zhang, F.; Gao, T.
Improved Chimpanzee Search
Algorithm with Multi-Strategy
Fusion and Its Application. Machines
2023, 11, 250. https://doi.org/
10.3390/machines11020250
Academic Editor: Dan Zhang
Received: 14 December 2022
Revised: 30 January 2023
Accepted: 6 February 2023
Published: 8 February 2023
Copyright: © 2023 by the authors.
Licensee MDPI, Basel, Switzerland.
This article is an open access article
distributed under the terms and
conditions of the Creative Commons
Attribution (CC BY) license (https://
creativecommons.org/licenses/by/
4.0/).
machines
Article
Improved Chimpanzee Search Algorithm with Multi-Strategy
Fusion and Its Application
Hongda Wu, Fuxing Zhang and Teng Gao *
School of Mechanical Engineering and Automation, Dalian Polytechnic University, Dalian 116034, China
* Correspondence: gaoteng@dlpu.edu.cn
Abstract:
An improved chimpanzee optimization algorithm incorporating multiple strategies (IM-
SChoA) is proposed to address the problems of initialized population boundary aggregation dis-
tribution, slow convergence speed, low precision, and proneness to fall into local optimality of the
chimpanzee search algorithm. Firstly, the improved sine chaotic mapping is used to initialize the
population to solve the population boundary aggregation distribution problem. Secondly, a linear
weighting factor and an adaptive acceleration factor are added to join the particle swarm idea and
cooperate with the improved nonlinear convergence factor to balance the global search ability of
the algorithm, accelerate the convergence of the algorithm, and improve the convergence accuracy.
Finally, the sparrow elite mutation and Bernoulli chaos mapping strategy improved by adaptive
change water wave factor are added to improve the ability of individuals to jump out of the local
optimum. Through the comparative analysis of benchmark functions seeking optimization and the
comparison of Wilcoxon rank sum statistical test seeking results, it can be seen that the IMSChoA
optimization algorithm has stronger robustness and applicability. Further, the IMSChoA optimiza-
tion algorithm is applied to two engineering examples to verify the superiority of the IMSChoA
optimization algorithm in dealing with mechanical structure optimization design problems.
Keywords: improved sine chaos mapping; nonlinear decay factor; sparrow elite mutation
1. Introduction
Meta-heuristic algorithms are widely used in path planning [
1
], image detection [
2
],
system control [
3
], and shop floor scheduling [
4
] due to their excellent flexibility, practicality,
and robustness. Common meta-heuristic algorithms include the genetic algorithm (GA) [
5
,
6
],
the particle swarm optimization algorithm (PSO) [
7
,
8
], the gray wolf optimization algorithm
(GWO) [
9
,
10
], the chicken flock optimization algorithm (CSO) [
11
], the sparrow optimization
algorithm (CSA) [12], the whale optimization algorithm (WOA) [13], etc.
Different intelligent optimization algorithms exist with different search approaches,
but most of them aim at the balance between population diversity and search ability and
avoid premature maturity while ensuring convergence accuracy and speed [
14
]. In response
to the above ideas, numerous scholars have proposed improvements to the intelligent
algorithms they studied. For example, Zhi-jun Teng et al. [
15
] introduced the idea of PSO
on the basis of the gray wolf optimization algorithm, which preserved the individual
optimum while improving the ability of the algorithm to jump out of the local optimum;
Hussien A. G. et al. [
16
] proposed two transfer functions (S-shaped and V-shaped) to map
the continuous search space to the binary space, which improved the search accuracy and
speed of the whale optimization algorithm; Wang et al. [
17
] introduced a fuzzy system in
the process of chicken flock optimization algorithm, which adaptively adjusted the number
of individuals in the algorithm, as well as random factors to balance the local exploitation
performance and global search ability of the algorithm; Tian et al. [
18
] used logistic chaotic
mapping to improve the initial population quality of the particle swarm algorithm while
applying the auxiliary speed mechanism to the global optimal particles, which effectively
Machines 2023, 11, 250. https://doi.org/10.3390/machines11020250 https://www.mdpi.com/journal/machines
资源描述:

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。
关闭