A parallel vector-based particle swarm optimizer

被引：11

作者：

Schoeman, IL ^{[1
]}

Engelbrecht, AP ^{[1
]}

机构：

[1] Univ Pretoria, Dept Comp Sci, ZA-0002 Pretoria, South Africa

来源：

ADAPTIVE AND NATURAL COMPUTING ALGORITHMS | 2005年

关键词：

D O I：

10.1007/3-211-27389-1_64

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Several techniques have been employed to adapt particle swarm optimization to find multiple optimal solutions in a problem domain. Niching algorithms have to identify good candidate solutions among a population of particles in order to split the space into regions where an optimal solution may be found. Subsequently the swami must be optimized so that particles contained inside the niches will converge on multiple optimal solutions. This paper presents an improved vector-based particle swarm optimizer where subswarms contained in niches are optimized in parallel.

引用

页码：268 / 271

页数：4

共 9 条

[1]

Brits R., 2002, THESIS U PRETORIA PR

[2]

Brits R., 2002, P 4 AS PAC C SIM EV, V2, P692

[3]

Kennedy J., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1931, DOI 10.1109/CEC.1999.785509

[4]

Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968

[5]

Parsopoulos K.E., 2001, Proceedings of the Particle Swarm Optimization Workshop, P22

[6]

Parsopoulos KE, 2001, SPRING COMP SCI, P324

[7]

Reynolds C. W., 1987, P 14 ANN C COMP GRAP, V21, P25, DOI [DOI 10.1145/37401.37406, DOI 10.1145/37402]

[8]

SCHOEMAN IL, 2004, P C CYB INT SYST

[9] A modified particle swarm optimizer [J].

Shi, YH ;

Eberhart, R .

1998 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION - PROCEEDINGS, 1998, :69-73

← 1 →