An Improved Multiobjective Quantum-Behaved Particle Swarm Optimization Based on Double Search Strategy and Circular Transposon Mechanism
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2018/8702820 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832563820616220672 |
|---|---|
| author | Fei Han Yu-Wen-Tian Sun Qing-Hua Ling |
| author_facet | Fei Han Yu-Wen-Tian Sun Qing-Hua Ling |
| author_sort | Fei Han |
| collection | DOAJ |
| description | 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 dramatic diversity reduction of the solutions set in later iterations due to the single search pattern used in quantum-behaved particle swarm optimization (QPSO), the double search strategy is proposed in MOQPSO-DSCT. The particles mainly learn from their personal best position in earlier iterations and then the particles mainly learn from the global best position in later iterations to balance the exploration and exploitation ability of the swarm. Moreover, to alleviate the problem of the swarm converging to local minima during the local search, an improved attractor construction mechanism based on opposition-based learning is introduced to further search a better position locally as a new attractor for each particle. On the other hand, to improve the accuracy of the solutions set, the circular transposon mechanism is introduced into the external archive to improve the communication ability of the particles, which could guide the population toward the true Pareto front (PF). The proposed algorithm could generate a set of more accurate and well-distributed solutions compared to the traditional MOPSO. Finally, the experiments on a set of benchmark test functions have verified that the proposed algorithm has better convergence performance than some state-of-the-art multiobjective optimization algorithms. |
| format | Article |
| id | doaj-art-07cf668ed997408e960ef3662fb777d9 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2018-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-07cf668ed997408e960ef3662fb777d92025-02-03T01:12:24ZengWileyComplexity1076-27871099-05262018-01-01201810.1155/2018/87028208702820An Improved Multiobjective Quantum-Behaved Particle Swarm Optimization Based on Double Search Strategy and Circular Transposon MechanismFei Han0Yu-Wen-Tian Sun1Qing-Hua Ling2School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang, Jiangsu, ChinaSchool of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang, Jiangsu, ChinaSchool of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang, Jiangsu, ChinaAlthough 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 dramatic diversity reduction of the solutions set in later iterations due to the single search pattern used in quantum-behaved particle swarm optimization (QPSO), the double search strategy is proposed in MOQPSO-DSCT. The particles mainly learn from their personal best position in earlier iterations and then the particles mainly learn from the global best position in later iterations to balance the exploration and exploitation ability of the swarm. Moreover, to alleviate the problem of the swarm converging to local minima during the local search, an improved attractor construction mechanism based on opposition-based learning is introduced to further search a better position locally as a new attractor for each particle. On the other hand, to improve the accuracy of the solutions set, the circular transposon mechanism is introduced into the external archive to improve the communication ability of the particles, which could guide the population toward the true Pareto front (PF). The proposed algorithm could generate a set of more accurate and well-distributed solutions compared to the traditional MOPSO. Finally, the experiments on a set of benchmark test functions have verified that the proposed algorithm has better convergence performance than some state-of-the-art multiobjective optimization algorithms.http://dx.doi.org/10.1155/2018/8702820 |
| spellingShingle | Fei Han Yu-Wen-Tian Sun Qing-Hua Ling An Improved Multiobjective Quantum-Behaved Particle Swarm Optimization Based on Double Search Strategy and Circular Transposon Mechanism Complexity |
| title | An Improved Multiobjective Quantum-Behaved Particle Swarm Optimization Based on Double Search Strategy and Circular Transposon Mechanism |
| title_full | An Improved Multiobjective Quantum-Behaved Particle Swarm Optimization Based on Double Search Strategy and Circular Transposon Mechanism |
| title_fullStr | An Improved Multiobjective Quantum-Behaved Particle Swarm Optimization Based on Double Search Strategy and Circular Transposon Mechanism |
| title_full_unstemmed | An Improved Multiobjective Quantum-Behaved Particle Swarm Optimization Based on Double Search Strategy and Circular Transposon Mechanism |
| title_short | An Improved Multiobjective Quantum-Behaved Particle Swarm Optimization Based on Double Search Strategy and Circular Transposon Mechanism |
| title_sort | improved multiobjective quantum behaved particle swarm optimization based on double search strategy and circular transposon mechanism |
| url | http://dx.doi.org/10.1155/2018/8702820 |
| work_keys_str_mv | AT feihan animprovedmultiobjectivequantumbehavedparticleswarmoptimizationbasedondoublesearchstrategyandcirculartransposonmechanism AT yuwentiansun animprovedmultiobjectivequantumbehavedparticleswarmoptimizationbasedondoublesearchstrategyandcirculartransposonmechanism AT qinghualing animprovedmultiobjectivequantumbehavedparticleswarmoptimizationbasedondoublesearchstrategyandcirculartransposonmechanism AT feihan improvedmultiobjectivequantumbehavedparticleswarmoptimizationbasedondoublesearchstrategyandcirculartransposonmechanism AT yuwentiansun improvedmultiobjectivequantumbehavedparticleswarmoptimizationbasedondoublesearchstrategyandcirculartransposonmechanism AT qinghualing improvedmultiobjectivequantumbehavedparticleswarmoptimizationbasedondoublesearchstrategyandcirculartransposonmechanism |