增强的乌搜索算法与全球优化问题的多阶段搜索集成
Jieguang He1, Zhiping Peng2,3, Lei Zhang1
1College of Computer Science, Guangdong University of Petrochemical Technology, Maoming, China.
概括
增强的Crow搜索算法 (MSCSA) 通过整合多阶段搜索策略来提高复杂优化问题的性能,克服了原始算法的局限性,以获得更好的准确性和稳定性.
科学领域:
- 计算智能是一种计算智能.
- 群集情报 群集情报 群集情报
- 优化算法 优化算法
背景情况:
- 乌搜索算法 (CSA) 是一种模拟乌寻行为的群体智能方法.
- 标准CSA面临着复杂,高维度问题的挑战,表现出停滞,缓慢的融合和低强度.
- 这些局限性源于CSA的单阶段搜索,依赖于随机的个体相互作用.
研究的目的:
- 引入多阶段搜索集成群众搜索算法 (MSCSA) 来解决CSA的缺陷.
- 为了提高复杂和高维度的全球优化问题的CSA的性能.
- 与原来的CSA相比,为了提高融合速度,准确性和稳定性.
主要方法:
- 引入混乱和基于对立的学习,以提高最初的人口质量和ergodicity.
- 实现了使用正常分布和Lévy飞行进行本地搜索和精度的免费食阶段.
- 为全球搜索和扩展勘探开发了一个混合指导的个人下一步.
- 纳入了一个大规模的迁移阶段,利用最好的个体来促进多样性并逃避当地最佳.
主要成果:
- 通过其多阶段的方法,MSCSA在全球勘探和当地开发之间取得了卓越的平衡.
- 关于CEC 2017和CEC 2010基准函数的实验表明了MSCSA的竞争力.
- MSCSA显著超过了原来的CSA,它的变体,以及其他最先进的元启发术.
结论:
- 拟议的MSCSA有效地克服了标准CSA对复杂优化任务的局限性.
- MSCSA提供了增强的稳定性,准确性和融合速度.
- 多阶段集成策略对于大规模,复杂的优化问题是有效的.
相关概念视频
Optimal Foraging
12.2K
How animals obtain and eat their food is called foraging behavior. Foraging can include searching for plants and hunting for prey and depends on the species and environment.
12.2K
Collisions in Multiple Dimensions: Problem Solving
4.3K
In multiple dimensions, the conservation of momentum applies in each direction independently. Hence, to solve collisions in multiple dimensions, we should write down the momentum conservation in each direction separately. To help understand collisions in multiple dimensions, consider an example.
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
4.3K
Statically Indeterminate Problem Solving
457
Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
457
Heuristics
111
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
111
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
84
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
84
Cluster Sampling Method
12.0K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
12.0K


