Skip to main content
Log in

Quantum-behaved particle swarm optimization with generalized space transformation search

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

Nature-inspired algorithms have been proved to be very powerful methods for complex numerical optimization problems. Quantum-behaved particle swarm optimization (QPSO) is a typical member of nature-inspired algorithms, and it is a simple and effective population-based technique used in numerical optimization. Despite its efficiency and wide use, QPSO suffers from premature convergence and poor balance between exploration and exploitation in solving complex optimization problems. To address these issues, a new evolutionary technique called generalized space transformation search is proposed, and then, we introduce an improved quantum-behaved particle swarm optimization algorithm combined with this new technique in this study. The proposed generalized space transformation search is based on opposition-based learning and generalized opposition-based learning, which can not only improve the exploitation of the current search space but also strengthen the exploration of the neighborhood of the current search space. The improved quantum-behaved particle swarm optimization algorithm employs generalized space transformation search for population initialization and generation jumping. A comprehensive set of 16 well-known unconstrained benchmark functions is employed for experimental verification. The contribution of the generalized space transformation search is empirically verified, and the influence of dimensionality is also investigated. Besides, the improved quantum-behaved particle swarm optimization algorithm is also compared with some typical extensions of QPSO and several competitive meta-heuristic algorithms. Such comparisons suggest that the improved quantum-behaved particle swarm optimization algorithm may lead to finding promising solutions compared to the other algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhigang Jin.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Human and animal rights

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by V. Loia.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, Y., Jin, Z. Quantum-behaved particle swarm optimization with generalized space transformation search. Soft Comput 24, 14981–14997 (2020). https://doi.org/10.1007/s00500-020-04850-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-04850-7

Keywords

Navigation