Particle swarm inspired optimization algorithm without velocity equation

被引:25
作者
El-Sherbiny, Mahmoud Mostafa [1 ]
机构
[1] King Saud Univ, Fac Business Adm, Dept Quantitat Anal, Riyadh, Saudi Arabia
关键词
Particle swarm optimization; Convergence; Evolutionary computation;
D O I
10.1016/j.eij.2011.02.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 [模式识别与智能系统]; 0812 [计算机科学与技术]; 0835 [软件工程]; 1405 [智能科学与技术];
摘要
This paper introduces Particle Swarm Without Velocity equation optimization algorithm (PSWV) that significantly reduces the number of iterations required to reach good solutions for optimization problems. PSWV algorithm uses a set of particles as in particle swarm optimization algorithm but a different mechanism for finding the next position for each particle is used in order to reach a good solution in a minimum number of iterations. In PSWV algorithm, the new position of each particle is determined directly from the result of linear combination between its own best position and the swarm best position without using velocity equation. The results of PSWV algorithm and the results of different variations of particle swarm optimizer are experimentally compared. The performance of PSWV algorithm and the solution quality prove that PSWV is highly competitive and can be considered as a viable alternative to solve optimization problems. (C) 2011 Faculty of Computers and Information, Cairo University. Production and hosting by Elsevier B. V. All rights reserved.
引用
收藏
页码:1 / 8
页数:8
相关论文
共 23 条
[1]
Particle swarm optimization versus genetic algorithms for phased array synthesis [J].
Boeringer, DW ;
Werner, DH .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2004, 52 (03) :771-779
[2]
The particle swarm - Explosion, stability, and convergence in a multidimensional complex space [J].
Clerc, M ;
Kennedy, J .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) :58-73
[3]
Clerc M., 1999, P 1999 C EV COMP CEC, V3, P1951, DOI [10.1109/CEC.1999.785513., DOI 10.1109/CEC.1999.785513]
[4]
Eberhart R., 1995, P 6 INT S MICROMACHI, P39, DOI DOI 10.1109/MHS.1995.494215
[5]
Eberhart R., 1999, P 6 INT S MICROMACHI, V3-267, P39, DOI [DOI 10.1109/MHS.1995.494215, 10.1.1.470.3577]
[6]
El Sherbiny MM, 2007, INT J COMPUT INF IJC, V1, P13
[7]
Maximum loadability of power systems using hybrid particle swarm optimization [J].
El-Dib, AA ;
Youssef, HKM ;
El-Metwally, MM ;
Osman, Z .
ELECTRIC POWER SYSTEMS RESEARCH, 2006, 76 (6-7) :485-492
[8]
El-Sherbiny MM., 2009, INT J COMP INF IJCI, V2, P17
[9]
Stability analysis of social foraging swarms [J].
Gazi, V ;
Passino, KM .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2004, 34 (01) :539-557
[10]
The particle swarm: Social adaptation of knowledge [J].
Kennedy, J .
PROCEEDINGS OF 1997 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '97), 1997, :303-308