返回
Vector-based swarm optimization algorithm
DOI:10.1016/j.asoc.2015.09.008.png)
摘要
En 中文
Evolutionary algorithms and nature-inspired optimization algorithms are widely used in solving non-linear optimization problems. Considering a D-dimensional space, this paper introduces a new random search algorithm called vector-based swarm optimization (VBSO). In this method, vectors with appropriate orientation gradually converge to a global optimum point. In the VBSO, random weighting coefficients are used with a predetermined strategy. Using multiplication of these coefficients by suitable vectors, the randomness property is provided. Taking same conditions into account, the proposed algorithm is compared with a number of well-known intuitive algorithms. Considering 29 unimodal and multimodal benchmark functions, simulation results confirm that the VBSO performs faster and more accurate than intuitive algorithms, such as CEP, FEP, GA, PSO, GSA, DE and ODE, in most cases. To evaluate the performance of the proposed algorithm in coping with difficult situations, some challenging cases are considered. They may have large number of variables, few number of populations, few number of iterations, or may be shifted functions with huge number of optimums. Overall, the simulation results reveal that the performance of the VBSO is satisfactory for such challenging cases. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Evolutionary algorithms
Vector-based swarm optimization
Cooperation operator
Direct cooperation vector
Differential cooperation vector
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Kinematic and kinetic differences in the execution of vertical jumps between people with good and poor ankle joint dorsiflexion踝关节背屈良好和不良的人在执行垂直跳跃时的运动学和动力学差异
Differential evolution algorithm with ensemble of parameters and mutation strategies具有参数集成和变异策略的差分进化算法

