Barebones particle swarm for integer programming problems

被引：15

作者：

Omran, Mahamed G. H. ^{[1
]}

Engelbrecht, Andries ^{[2
]}

Salman, Ayed ^{[3
]}

机构：

[1] Gulf Univ Sci & Technol, Dept Comp Sci, Kuwait, Kuwait

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

[3] Kuwait Univ, Dept Comp Engn, Safat 13060, Kuwait

来源：

2007 IEEE SWARM INTELLIGENCE SYMPOSIUM | 2007年

关键词：

D O I：

10.1109/SIS.2007.368042

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The performance of two recent variants of Particle Swarm Optimization (PSO) when applied to Integer Programming problems is investigated. The two PSO variants, namely, barebones Particle Swarm (BB) and the exploiting barebones Particle Swarm (BBExp) are compared with the standard PSO and standard Differential Evolution (DE) on several Integer Programming test problems. The results show that the BBExp seems to be an efficient alternative for solving Integer Programming problems.

引用

页码：170 / +

页数：3

共 13 条

[1]

[Anonymous], 1995, DIFFERENTIAL EVOLUTI

[2]

[Anonymous], 2002, COMPUTATIONAL INTELL

[3] 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

[4]

Horst R., 1996, GLOBAL OPTIMIZATION, DOI [DOI 10.1007/978-3-662-03199-5, 10.1007/978-3-662-03199-5]

[5] Bare bones particle swarms [J].

Kennedy, J .

PROCEEDINGS OF THE 2003 IEEE SWARM INTELLIGENCE SYMPOSIUM (SIS 03), 2003, :80-87

[6]

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

[7]

LASKARI EC, 2002, P 2002 C EV COMP CEC, V2, P1582

[8] Recent approaches to global optimization problems through Particle Swarm Optimization [J].

K.E. Parsopoulos ;

M.N. Vrahatis .

Natural Computing, 2002, 1 (2-3) :235-306

[9]

PRICE K, 2006, DE WEB SITE

[10]

Rudolph G, 1994, LECT NOTES COMPUT SC, V866, P139

← 1 2 →