Second fitness selection QPSO and SA cooperative search for large-scale discrete optimization algorithm
To address the large-scale discrete optimization problem,a cooperative optimization algorithm called IDQPSO-SA was proposed.First,a strategy by applying two selections on the averaging fitness values to update the mean best position was presented,which could overcome the deficiency that QPSO was not...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2020-08-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020173/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | To address the large-scale discrete optimization problem,a cooperative optimization algorithm called IDQPSO-SA was proposed.First,a strategy by applying two selections on the averaging fitness values to update the mean best position was presented,which could overcome the deficiency that QPSO was not applicable for discrete problems.Second,the double cut joining (DCJ) sorting strategy was incorporated into IDQPSO-SA,since the DCJ sorting strategy could considerably reduce the search space.Finally,the probability jumping ability of simulated annealing (SA) was combined with the parallel search of QPSO,and the global search was carried out collaboratively.By comparing with existing algorithms,the experimental results show that IDQPSO-SA further improves the search efficiency and has a comparable performance when faced with large-scale discrete optimization problems. |
|---|---|
| ISSN: | 1000-436X |