Study of the ternary correlation quantum-behaved PSO algorithm
In order to more effectively utilize existing information and improve QPSO's (quantum-behaved particle swarm optimization) convergence performance, the ternary correlation QPSO (TC-QPSO) algorithm was proposed based on the analysis of the random factors in location formula. The novel algorithm...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2015-03-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015076/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In order to more effectively utilize existing information and improve QPSO's (quantum-behaved particle swarm optimization) convergence performance, the ternary correlation QPSO (TC-QPSO) algorithm was proposed based on the analysis of the random factors in location formula. The novel algorithm changed the information independent ran-dom processing method of standard QPSO and established internal relations during particles' own experience information, group sharing information and the distance from the particles' current location to the population mean best position using normal copula functions.Then, the method of generating ternary correlation factors was given by using the Cholesky square root formula. The simulation results of the test functions showed that TC-QPSO algorithm outperforms the stan-dard QPSO algorithm in terms of optimization results, given that the negative linear correlation exists betweenu and r1 or u andr2. |
|---|---|
| ISSN: | 1000-436X |