Skip to main content

Competition of Strategies in jSO Algorithm

  • Conference paper
  • First Online:
Swarm, Evolutionary, and Memetic Computing and Fuzzy and Neural Computing (SEMCCO 2019, FANCCO 2019)

Abstract

A newly proposed variant of the efficient jSO algorithm employing competition of eight strategies (cSO) is proposed. The main idea is to select the most proper strategy and adapt the setting to each solved problem. One more mutation variant and one more type of crossover are added to jSO, and moreover, the popular mechanism of Eigen coordinate system is applied. All eight strategies compete to be used in the next generations based on the successes in previous generations. The proposed cSO method has more wins over jSO significantly in more real-world problems than fails. The original jSO strategy is never the most frequently used strategy, compared with other newly employed strategies.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Brest, J., Maučec, M.S., Bošković, B.: Single objective real-parameter optimization: algorithm jSO. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 1311–1318 (2017)

    Google Scholar 

  2. Bujok, P., Poláková, R.: Migration model of jSO algorithm. In: 2018 25th International Conference on Systems Signals and Image Processing (IWSSIP). IEEE, New York (2018). IEEE Slovenia Section, University of Maribor

    Google Scholar 

  3. Bujok, P., Poláková, R.: Eigenvector crossover in the efficient jSO algorithm. MENDEL Soft Comput. J. 25, 65–72 (2019)

    Google Scholar 

  4. Bujok, P.: Tvrdík: enhanced success-history based parameter adaptation for differential evolution and real-world optimization problems. In: Papa, G., Mernik, M. (eds.) Bioinspired Optimization Methods and Their Applications, BIOMA, Bled, Slovenian, pp. 159–171 (2016)

    Google Scholar 

  5. Bujok, P., Tvrdík, J.: A comparison of various strategies in differential evolution. In: Matoušek, R. (ed.) MENDEL: 17th International Conference on Soft Computing, Brno, Czech Republic, pp. 48–55 (2011)

    Google Scholar 

  6. Bujok, P., Tvrdík, J., Poláková, R.: Evaluating the performance of SHADE with competing strategies on CEC 2014 single-parameter test suite. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 5002–5009 (2016)

    Google Scholar 

  7. Das, S., Mullick, S.S., Suganthan, P.N.: Recent advances in differential evolution-an updated survey. Swarm Evol. Comput. 27, 1–30 (2016)

    Article  Google Scholar 

  8. Das, S., Suganthan, P.N.: Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems. Technical report, Jadavpur University, India and Nanyang Technological University, Singapore (2010)

    Google Scholar 

  9. Elsayed, S.M., Sarker, R.A., Essam, D.L.: GA with a new multi-parent crossover for solving IEEE-CEC2011 competition problems. In: 2011 IEEE Congress of Evolutionary Computation (CEC), pp. 1034–1040 (2011)

    Google Scholar 

  10. Kotyrba, M., Volna, E., Bujok, P.: Unconventional modelling of complex system via cellular automata and differential evolution. Swarm Evol. Comput. 25, 52–62 (2015)

    Article  Google Scholar 

  11. Storn, R., Price, K.V.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11, 341–359 (1997)

    Article  MathSciNet  Google Scholar 

  12. 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 

  13. Tvrdík, J.: Competitive differential evolution. In: Matoušek, R., Ošmera, P. (eds.) MENDEL 2006, 12th International Conference on Soft Computing, pp. 7–12. University of Technology, Brno (2006)

    Google Scholar 

  14. Wang, Y., Li, H.X., Huang, T., Li, L.: Differential evolution based on covariance matrix learning and bimodal distribution parameter setting. Appl. Soft Comput. 18, 232–247 (2014)

    Article  Google Scholar 

  15. Wu, G., Mallipeddi, R., Suganthan, P.N.: Ensemble strategies for population-based optimization algorithms - a survey. Swarm Evol. Comput. 44, 695–711 (2019)

    Article  Google Scholar 

  16. Zamuda, A., Sosa, J.D.H.: Success history applied to expert system for underwater glider path planning using differential evolution. Expert Syst. Appl. 119, 155–170 (2019)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Petr Bujok .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bujok, P. (2020). Competition of Strategies in jSO Algorithm. In: Zamuda, A., Das, S., Suganthan, P., Panigrahi, B. (eds) Swarm, Evolutionary, and Memetic Computing and Fuzzy and Neural Computing. SEMCCO FANCCO 2019 2019. Communications in Computer and Information Science, vol 1092. Springer, Cham. https://doi.org/10.1007/978-3-030-37838-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-37838-7_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-37837-0

  • Online ISBN: 978-3-030-37838-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics