SpringerLink
Log in

Tracking the Exploration and Exploitation in Stochastic Population-Based Nature-Inspired Algorithms Using Recurrence Plots

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

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1092))

  • 409 Accesses

Abstract

The success of every stochastic population-based nature-inspired algorithms is characterized through the dichotomy of exploration and exploitation. In general, exploration refers to the evaluation of points in previously untested areas of a search space, while exploitation refers to evaluation of points in close vicinity to previously visited points. How to balance both components properly during the evolutionary process is still considered as a topical problem in the evolutionary computation community. In this paper, we propose a recurrence plot visualization method for evaluating this process. Our analysis shows that recurrence plots are highly appropriate for revealing how particular algorithms balance exploration and exploitation.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
EUR 32.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

Chapter
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 42.79
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 53.49
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Sorted alphabetically.

  2. 2.

    Only selected figures are presented in this paper.

References

  1. Črepinšek, M., Liu, S.-H., Mernik, M.: Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput. Surv. (CSUR) 45(3), 35 (2013)

    Article  Google Scholar 

  2. Donges, J.F., et al.: Unified functional network and nonlinear time series analysis for complex systems science: the Pyunicorn package. Chaos: Interdisc. J. Nonlinear Sci. 25(11), 113101 (2015)

    Article  MathSciNet  Google Scholar 

  3. Eckmann, J.-P., Oliffson Kamphorst, S., Ruelle, D.: Recurrence plots of dynamical systems. EPL (Europhys. Lett.) 4(9), 973 (1987)

    Article  Google Scholar 

  4. Engelbrecht, A.P.: Computational Intelligence: An Introduction. Wiley, Hoboken (2007)

    Book  Google Scholar 

  5. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Company, Boston (1989)

    MATH  Google Scholar 

  6. Jamil, M., Yang, X.-S.: A literature survey of benchmark functions for global optimisation problems. Int. J. Math. Model. Numer. Optim. 4(2), 150–194 (2013)

    MATH  Google Scholar 

  7. Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Glob. Optim. 39(3), 459–471 (2007)

    Article  MathSciNet  Google Scholar 

  8. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks 1995, vol. 4, pp. 1942–1948. IEEE (1995)

    Google Scholar 

  9. Marwan, N., Romano, M.C., Thiel, M., Kurths, J.: Recurrence plots for the analysis of complex systems. Phys. Rep. 438(5–6), 237–329 (2007)

    Article  MathSciNet  Google Scholar 

  10. Marwan, N., Wessel, N., Meyerfeldt, U., Schirdewan, A., Kurths, J.: Recurrence-plot-based measures of complexity and their application to heart-rate-variability data. Phys. Rev. E 66(2), 026702 (2002)

    Article  Google Scholar 

  11. Rawald, T., Sips, M., Marwan, N.: PyRQA-conducting recurrence quantification analysis on very long time series efficiently. Comput. Geosci. 104, 101–108 (2017)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. Vantuch, T., Zelinka, I., Adamatzky, A., Marwan, N.: Phase transitions in swarm optimization algorithms. In: Stepney, S., Verlan, S. (eds.) UCNC 2018. LNCS, vol. 10867, pp. 204–216. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-92435-9_15

    Chapter  Google Scholar 

  14. Webber Jr., C.L., Zbilut, J.P.: Dynamical assessment of physiological systems and states using recurrence plot strategies. J. Appl. Physiol. 76(2), 965–973 (1994)

    Article  Google Scholar 

  15. Yang, X.-S.: Firefly algorithm, stochastic test functions and design optimisation. Int. J. Bio-Inspir. Comput. 2(2), 78–84 (2010)

    Article  Google Scholar 

  16. Yang, X.-S.: A new metaheuristic bat-inspired algorithm. In: González, J.R., Pelta, D.A., Cruz, C., Terrazas, G., Krasnogor, N. (eds.) Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), pp. 65–74. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12538-6_6

    Chapter  Google Scholar 

Download references

Acknowledgment

Iztok Fister Jr. acknowledge the financial support from the Slovenian Research Agency (Research Core Funding No. P2-0057).

Author information

Authors and Affiliations

  1. Digital Media Research Centre, Queensland University of Technology, Brisbane, QLD, 4059, Australia

    Daniel Angus

  2. Faculty of Electrical Engineering and Computer Science, University of Maribor, Koroška cesta 46, Maribor, Slovenia

    Iztok Fister Jr.

Authors
  1. Daniel Angus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Iztok Fister Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Iztok Fister Jr. .

Editor information

Editors and Affiliations

  1. University of Maribor, Maribor, Slovenia

    Aleš Zamuda

  2. Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata, West Bengal, India

    Swagatam Das

  3. Division of Control and Instrumentation, Nanyang Technological University, Singapore, Singapore

    Ponnuthurai Nagaratnam Suganthan

  4. Department of Electrical Engineering, Indian Institute of Technology Delhi, New Delhi, Delhi, India

    Bijaya Ketan Panigrahi

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

Angus, D., Fister, I. (2020). Tracking the Exploration and Exploitation in Stochastic Population-Based Nature-Inspired Algorithms Using Recurrence Plots. 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_15

Download citation

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

  • 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

Search

Navigation