A quantum particle swarm optimization

被引：151

作者：

Yang, SY ^{[1
]}

Wang, M ^{[1
]}

Jiao, LC ^{[1
]}

机构：

[1] Xidian Univ, Dept Elect & Comp Engn, Xian 710071, Peoples R China

来源：

CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2 | 2004年

关键词：

D O I：

10.1109/CEC.2004.1330874

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The particle swarm optimization algorithm is a new methodology in evolutionary computation. It has been found to be extremely effective in solving a wide range of engineering problems, however, it is of low efficiency in dealing with the discrete problems. In this paper, a new discrete particle swarm optimization algorithm based on quantum individual is proposed. It is simpler and more powerful than the algorithms available. The simulations experiments and its application in the CDMA also prove its high efficiency.

引用

页码：320 / 324

页数：5

共 16 条

[1]

Abido MA, 2001, 2001 POWER ENGINEERING SOCIETY SUMMER MEETING, VOLS 1-3, CONFERENCE PROCEEDINGS, P1346, DOI 10.1109/PESS.2001.970272

[2]

[Anonymous], EVOLUTIONARY PROGRAM

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

Eberhart R, 1995, MHS 95 P 6 INT S MIC, P39, DOI DOI 10.1109/MHS.1995.494215

[5]

Eberhart R. C., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1927, DOI 10.1109/CEC.1999.785508

[6]

Eberhart R.C., 1998, P INT C NEUR NETW BR, V1, pPL5

[7]

Eberhart RC, 2000, IEEE C EVOL COMPUTAT, P84, DOI 10.1109/CEC.2000.870279

[8]

HE Z, 1998, IEEE INT C EV COMP A

[9]

HU X, MULTIOBJECTIVE OPTIM

[10]

Hu X, 2001, P WORKSH PART SWARM

← 1 2 →