Nothing Special   »   [go: up one dir, main page]

Skip to main content

Advertisement

Log in

Elite-guided multi-objective cuckoo search algorithm based on crossover operation and information enhancement

  • Optimization
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

In recent years, the cuckoo search (CS) algorithm has been successfully applied to single-objective optimization problems. But in real life, most optimization problems are multi-objective optimization problems (MOPs). In order to enable CS to better solve MOPs, this paper proposes an elite-guided multi-objective cuckoo search algorithm based on cross-operation and information enhancement (CIE-MOCS). This algorithm first enhances its population diversity through crossover operation, then adds elite individuals to guide its update process to speed up the algorithm convergence speed. Finally, the method of information enhancement is adopted in the abandonment process, so that the algorithm is not easy to fall into the local optimum. In order to verify the performance of the algorithm, this paper uses a variety of benchmark functions and performance evaluation indicators to evaluate it, and provides a case to verify the effectiveness of the algorithm in practical applications. The experimental results show that CIE-MOCS has good performance compared with the contrasting algorithms.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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
Fig. 9
Fig. 10

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Data availability

Enquiries about data availability should be directed to the authors.

References

Download references

Funding

This work is supported by the 1. National Natural Science Foundation of China (Grant No. 62073281), 2. the Hebei Provincial Natural Science Foundation (Grant No. F2022203088), 3. the Hebei Provincial Science and Technology Plan Project (Grant No. 19211602D), 4. the Second Batch of Youth Top-notch Talent Support Program in Hebei Province (Grant No. 5040050).

Author information

Authors and Affiliations

Authors

Contributions

All authors listed have made a substantial, direct and intellectual contribution to the work, and approved it for publication.

Corresponding author

Correspondence to Xiaochen Hao.

Ethics declarations

Conflict of interest

All authors declare that they have no conflict of interest.

Ethical approval

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

Informed consent

Informed consent was obtained from all individual participants included in the study.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, X., Hao, X., Yang, T. et al. Elite-guided multi-objective cuckoo search algorithm based on crossover operation and information enhancement. Soft Comput 27, 4761–4778 (2023). https://doi.org/10.1007/s00500-022-07605-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-022-07605-8

Keywords