2018
DOI: 10.1155/2018/8702820
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Multiobjective Quantum‐Behaved Particle Swarm Optimization Based on Double Search Strategy and Circular Transposon Mechanism

Abstract: Although multiobjective particle swarm optimization (MOPSO) has good performance in solving multiobjective optimization problems, how to obtain more accurate solutions as well as improve the distribution of the solutions set is still a challenge. In this paper, to improve the convergence performance of MOPSO, an improved multiobjective quantum-behaved particle swarm optimization based on double search strategy and circular transposon mechanism (MOQPSO-DSCT) is proposed. On one hand, to solve the problem of the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(16 citation statements)
references
References 33 publications
0
16
0
Order By: Relevance
“…The diversity of solutions obtained by the algorithm can also be guaranteed by using external archive. However, when the archive is full, as was adopted in [11], [12], [16], there are some problems with the traditional approach of maintaining external archive by directly eliminating particles with the smallest crowding distance. One solution that is considered crowded may become less crowded when other nearby solutions that cause its crowding are eliminated.…”
Section: The Modified Double-archive Mechanismmentioning
confidence: 99%
See 2 more Smart Citations
“…The diversity of solutions obtained by the algorithm can also be guaranteed by using external archive. However, when the archive is full, as was adopted in [11], [12], [16], there are some problems with the traditional approach of maintaining external archive by directly eliminating particles with the smallest crowding distance. One solution that is considered crowded may become less crowded when other nearby solutions that cause its crowding are eliminated.…”
Section: The Modified Double-archive Mechanismmentioning
confidence: 99%
“…The conventional leader selection approach in [11], [12], [16] is to select the particle with larger crowding distance in the external archive. This is certainly feasible, it can avoid the solutions obtained by the algorithm to concentrate in a certain region, and thus the diversity of the solutions can be guaranteed.…”
Section: A Novel Leader Selection Strategymentioning
confidence: 99%
See 1 more Smart Citation
“…, }), its T closest weight vectors are assigned as its neighbors ( ) in lines (3)-(5), where 1 ≤ ≤ . Then, the ideal point will be initialized by finding the best value of each objective and the nadir point will be initialized using the corner solutions in lines (6)- (7), which have been introduced in Section 3.1. Afterward, like other MOEA/Ds [19][20][21][22][23][24][25], parent solutions are randomly selected from the neighborhood with a high probability in line (11).…”
Section: Generation Of Multiple Utopian Points In Existing Moe-mentioning
confidence: 99%
“…Compared with traditional mathematical methods, MOEAs can well solve various kinds of MOPs without their differentiable and derivable characteristics. Due to these advantages, MOEAs have been very popular in recent years [7][8][9][10].…”
Section: Introductionmentioning
confidence: 99%