Skip to main content

Composite Evolutionary Strategy and Differential Evolution Method for the ICSI’2022 Competition

  • Conference paper
  • First Online:
Advances in Swarm Intelligence (ICSI 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13345))

Included in the following conference series:

  • 566 Accesses

Abstract

In this paper, a composite method for bound constrained optimization called Composite Evolutionary Strategy and Differential Evolution (CESDE) is described. This method combines two well-performing methods from the Congress on Evolutionary Computation Competitions. Through numerical investigation on the ICSI’2022 benchmark set, the favourite scheme for combining the two methods was determined, and it was found that CESDE outperforms both of its “parental” methods on all studied instances.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Biswas, S., Saha, D., De, S., Cobb, A.D., Das, S., Jalaian, B.A.: Improving differential evolution through Bayesian hyperparameter optimization. In: 2021 IEEE Congress on Evolutionary Computation (CEC) (2021)

    Google Scholar 

  2. Das, S., Suganthan, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4–31 (2010)

    Article  Google Scholar 

  3. Hadi, A.A., Mohamed, A.W., Jambi, K.M.: Single-objective real-parameter optimization: enhanced LSHADE-SPACMA algorithm. In: Yalaoui, F., Amodeo, L., Talbi, E.-G. (eds.) Heuristics for Optimization and Learning. SCI, vol. 906, pp. 103–121. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-58930-1_7

    Chapter  Google Scholar 

  4. Ji, Y., Xing, Y.: An optimized three-sub-step composite time integration method with controllable numerical dissipation. Comput. Struct. 231, 106210 (2020)

    Google Scholar 

  5. Kazikova, A., Pluhacek, M., Senkerik, R.: Why tuning the control parameters of metaheuristic algorithms is so important for fair comparison? MENDEL J. 26(2), 9–16 (2020)

    Article  Google Scholar 

  6. Kudela, J., Popela, P.: Two-stage stochastic facility location problem: GA with benders decomposition. In: Mendel, vol. 21, pp. 53–58 (2015)

    Google Scholar 

  7. Kudela, J., Matousek, R.: New benchmark functions for single-objective optimization based on a zigzag pattern. IEEE Access 10, 8262–8278 (2022)

    Article  Google Scholar 

  8. Matousek, R., Dobrovsky, L., Kudela, J.: How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem. Int. J. Ind. Eng. Comput. 13(2), 151–164 (2022)

    Google Scholar 

  9. Matousek, R., Hulka, T.: Stabilization of higher periodic orbits of the chaotic logistic and Hénon maps using meta-evolutionary approaches. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 1758–1765. IEEE (2019)

    Google Scholar 

  10. Matousek, R., Popela, P., Kudela, J.: Heuristic approaches to stochastic quadratic assignment problem: VaR and CVaR cases. In: Mendel, vol. 23, pp. 73–78 (2017)

    Google Scholar 

  11. Sallam, K.M., Elsayed, S.M., Chakrabortty, R.K., Ryan, M.J.: Improved multi-operator differential evolution algorithm for solving unconstrained problems. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8 (2020)

    Google Scholar 

  12. Schröder, D., Vermetten, D., Wang, H., Doerr, C., Bäck, T.: Chaining of numerical black-box algorithms: warm-starting and switching points. arXiv preprint arXiv:2204.06539 (2022)

  13. Tanabe, R., Fukunaga, A.S.: Improving the search performance of shade using linear population size reduction. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 1658–1665 (2014)

    Google Scholar 

  14. Yifan, L.: Definitions for the ICSI optimization competition 2022 on single objective bounded optimization problems. Key Laboratory of Machine Perception, Peking University, China, Technical report (2022)

    Google Scholar 

  15. Young, S.R., Rose, D.C., Karnowski, T.P., Lim, S.H., Patton, R.M.: Optimizing deep learning hyper-parameters through an evolutionary algorithm. In: Proceedings of the Workshop on Machine Learning in High-Performance Computing Environments, pp. 1–5 (2015)

    Google Scholar 

  16. Zhang, G., Shi, Y.: Hybrid sampling evolution strategy for solving single objective bound constrained problems. In: 2018 IEEE Congress on Evolutionary Computation (CEC), pp. 1–7 (2018)

    Google Scholar 

  17. Žufan, P., Bidlo, M.: Advances in evolutionary optimization of quantum operators. MENDEL J. 27(2), 12–22 (2021)

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by internal grant agency of BUT: FME-S-20-6538 “Industry 4.0 and AI methods”, FIT/FSI-J-22-7980, and FEKT/FSI-J-22-7968.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jakub Kudela .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kudela, J., Nevoral, T., Holoubek, T. (2022). Composite Evolutionary Strategy and Differential Evolution Method for the ICSI’2022 Competition. In: Tan, Y., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2022. Lecture Notes in Computer Science, vol 13345. Springer, Cham. https://doi.org/10.1007/978-3-031-09726-3_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-09726-3_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-09725-6

  • Online ISBN: 978-3-031-09726-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics