Multi-Scale Quantum Harmonic Oscillator Algorithm With Truncated Mean Stabilization Strategy for Global Numerical Optimization Problems
A multi-scale quantum harmonic oscillator algorithm (MQHOA) is a quantum population-based algorithm proposed recently. It utilizes the quantum wave function to locate the global optimum of a global numerical optimization problem. As the MQHOA employs the elitism to replace the worst particle in each...
Saved in:
| Published in: | IEEE access Vol. 7; pp. 18926 - 18939 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Piscataway
IEEE
2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 2169-3536, 2169-3536 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A multi-scale quantum harmonic oscillator algorithm (MQHOA) is a quantum population-based algorithm proposed recently. It utilizes the quantum wave function to locate the global optimum of a global numerical optimization problem. As the MQHOA employs the elitism to replace the worst particle in each iteration cycle, it reduces one of the particles in each run, which will cripple the diversity of the population and slow down the convergence speed. Therefore, the particles will be easily trapped into local optima. In this paper, we suggest a new MQHOA with truncated mean stabilization (TS-MQHOA) policy to alleviate the above-mentioned problems. The theoretical and experimental analyses indicate that the truncated mean stabilization strategy helps to diversify the populations and improve the convergence efficiency. The proposed TS-MQHOA is evaluated on a number of dimensionwise unimodal and multimodal CEC benchmark functions, and the computational results are compared with several popular population-based algorithms. The experimental results on complex test problems demonstrate that the proposed TS-MQHOA, in most function evaluations, is able to obtain better convergence toward the global optimum compared with several renowned heuristic algorithms based on swarm intelligence. Meanwhile, the comparative results reveal the competitiveness and superiority of the proposed algorithm, especially on high-dimensional function evaluations. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2169-3536 2169-3536 |
| DOI: | 10.1109/ACCESS.2019.2893200 |