Skip to main content

Advertisement

SpringerLink
Log in

Investigation on evolutionary algorithms powered by nonrandom processes

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

Abstract

Inherent part of evolutionary algorithms that are based on Darwin’s theory of evolution and Mendel’s theory of genetic heritage, are random processes since genetic algorithms and evolutionary strategies are used. In this paper, we present extended experiments (of our previous) of selected evolutionary algorithms and test functions showing whether random processes really are needed in evolutionary algorithms. In our experiments we used differential evolution and SOMA algorithms with functions 2ndDeJong, Ackley, Griewangk, Rastrigin, SineWave and StretchedSineWave. We use n periodical deterministic processes (based on deterministic chaos principles) instead of pseudo-random number generators (PRGNs) and compare performance of evolutionary algorithms powered by those processes and by PRGNs. Results presented here are numerical demonstrations rather than mathematical proofs. We propose the hypothesis that a certain class of deterministic processes can be used instead of PRGNs without lowering the performance of evolutionary algorithms.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  • Beyer HG (2001) Theory of evolution strategies. Springer, New York

    Book  MATH  Google Scholar 

  • Binder P-M, Okamoto NH (2003) Unstable periodic orbits and discretization cycles. Phys Rev E 68:046206

    Article  Google Scholar 

  • Bucolo M, Caponetto R, Fortuna L, Frasca M, Rizzo A (2002) Does chaos work better than noise? IEEE Circuits Syst Mag 2(3):4–19. (Third Quarter)

  • Caponetto R, Fortuna L, Fazzino S, Xibilia M (2003) Chaotic sequences to improve the performance of evolutionary algorithms. IEEE Trans Evol Comput 7(3):289–304

    Article  Google Scholar 

  • Chia TT, Tan BL (1991) Maps with precision-dependent periods. Phys Rev A 44:R2231–R2234

  • Clerc M (2006) Particle swarm optimization. ISTE Publishing Company. ISBN 1905209045

  • Davendra D, Zelinka I, Senkerik R (2010) Chaos driven evolutionary algorithms for the task of PID control. Comput Math Appl 60(4):1088–1104. ISSN 0898–1221

  • Dellago C, Hoover WG (2000) Finite-precision stationary states at and away from equilibrium. Phys Rev E 62:62756281

    Article  Google Scholar 

  • Drutarovsky M, Galajda P (2007) A robust chaos-based true random number generator embedded in reconfigurable switched-capacitor hardware. In: 17th international conference Radioelektronika, Brno, vols. 1, 2, pp 29–34

  • Glover F, Laguna M, Mart R (2003) Scatter search. In: Ghosh A, Tsutsui S (eds) Advances in evolutionary computation: theory and applications. Springer, New York, pp 519–537

  • Holland JH (1992) Genetic algorithms. Sci Am 267(1):44–50

    Article  Google Scholar 

  • Hong W-C, Dong Y, Zhang, Wen Y, Chen L-Y, Panigrahi BK (2012) Cyclic electric load forecasting by seasonal SVR with chaotic genetic algorithm. Int J Electr Power Energy Syst 44(1):604–614. https://doi.org/10.1016/j.ijepes.2012.08.010

  • Hu HP, Liu LF, Ding ND (2013) Pseudorandom sequence generator based on the Chen chaotic system. Comput Phys Commun 184(3):765–768. https://doi.org/10.1016/j.cpc.2012.11.017

  • Longa L, Curado EMF, Oliveira FA (1996) Roundoff-induced coalescence of chaotic trajectories. Phys Rev E 54:R2201–R2204

  • Lozi R (2012) Emergence of randomness from chaos. Int J Bifurc Chaos 22(2):1250021. https://doi.org/10.1142/S0218127412500216. (World Scientific Publishing Company)

  • Matousek R (2008) GAHC: improved genetic algorithm. In: Krasnogor N (eds) Nature inspired cooperative strategies for optimization (NICSO’07), vol 129, XIV. Springer, New York, pp 507–520

  • Matousek R (2010) HC12: the principle of CUDA implementation. In: Matousek R (ed) 16th international conference on soft computing, MENDEL’10, Brno, pp 303–308

  • Matousek R, Zampachova E (2011) Promising GAHC and HC12 algorithms in global optimization tasks. J Optim Methods Softw 26(3):405–419. (Taylor & Francis, Inc., Bristol)

  • Nagaraj N, Shastry MC, Vaidya PG (2008) Increasing average period lengths by switching of robust chaos maps in finite precision. Eur Phys J Spec Top 165:7383

    Article  Google Scholar 

  • Pareek NK, Patidar V, Sud KK (2010) A random bit generator using chaotic maps. Int J Netw Secur 10(1):3238

  • Persohn KJ, Povinelli RJ (2012) Analyzing logistic map pseudorandom number generators for periodicity induced by finite precision floating-point representation. Chaos Solitons Fractals 45(3):238–245

    Article  Google Scholar 

  • Pluchino A, Rapisarda A, Tsallis C (2013) Noise, synchrony, and correlations at the edge of chaos. Phys Rev E 87(2). https://doi.org/10.1103/PhysRevE.87.022910

  • Pluhacek M, Budikova V, Senkerik R, Oplatkova Z, Zelinka I (2012a) Extended initial study on the performance of enhanced PSO algorithm with Lozi chaotic map. In: Proceedings of Nostradamus 2012: international conference on prediction, modeling and analysis of complex systems. Springer series: advances in intelligent systems and computing, vol 192, pp 167 178. ISBN 978-3-642-33226-5

  • Pluhacek M, Budikova V, Senkerik R, Oplatkova Z, Zelinka I (2012b) On the performance of enhanced PSO algorithm with Lozi chaotic map an initial study. In: Proceedings of 18th international conference on soft computing—MENDEL’12, pp 40–45. ISBN 978-80-214-4540-6

  • Pluhacek M, Senkerik R, Davendra D, Kominkova Oplatkova Z (2013) On the behaviour and performance of chaos driven PSO algorithm with inertia weight, computers and mathematics with applications. ISSN 0898–1221. (In print)

  • Price K (1999) An introduction to differential evolution. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, London, pp 79–108

  • Senkerik R, Davendra D, Zelinka I, Oplatkova Z, Pluhacek M (2012) Optimization of the batch reactor by means of chaos driven differential evolution. In: Proceedings of SOCO’12: soft computing models in industrial and environmental applications. Springer series: advances in intelligent systems and computing, vol 188, pp 93 102. ISBN 978-3-642-32922-7

  • Skanderova L, Zelinka I, Saloun P (2013) Algorithms chaos powered selected evolutionary. In: Proceedings of Nostradamus (2013): international conference prediction, modeling and analysis of complex systems. Springer series: advances in intelligent systems and computing, vol 210, pp 111–124

  • Sun Y, Zhang, L, Gu X (2010) A hybrid co-evolutionary cultural algorithm based on particle swarm optimization for solving global optimization problems. In: International conference on life system modeling and simulation/international conference on intelligent computing for sustainable energy and environment (LSMS-ICSEE), Wuxi

  • Wang X-Y, Yang L (2012) Design of pseudo-random bit generator based on chaotic maps. Int J Mod Phys B 26(32):1250208. https://doi.org/10.1142/S0217979212502086. (World Scientific Publishing Company)

  • Wang X, Qin X (2012) A new pseudo-random number generator based on CML and chaotic iteration. Nonlinear Dyn Int J Nonlinear Dyn Chaos Eng Syst 70(2):1589–1592. ISSN 0924–090X. https://doi.org/10.1007/s11071-012-0558-0

  • Zelinka I (2004) SOMA—self organizing migrating algorithm. In: Babu BV, Onwubolu G (eds) New optimization techniques in engineering. Springer, New York, pp 167–218

  • Zelinka I, Celikovsky S, Richter H, Chen G (eds) (2010) Evolutionary algorithms and chaotic systems, vol 550. Springer, Germany

  • Zelinka I, Chadli M, Davendra D, Senkerik R, Pluhacek M, Lampinen J (2013a) Do evolutionary algorithms indeed require random numbers? Extended study. In: Proceedings of Nostradamus 2013: international conference prediction, modeling and analysis of complex systems. Springer series: advances in intelligent systems and computing, vol 210, pp 61–75

  • Zelinka I, Chadli M, Davendra D, Senkerik R, Pluhacek M, Lampinen J (2013b) Hidden periodicity—chaos dependance on numerical precision. In: Proceedings of Nostradamus 2013: international conference prediction, modeling and analysis of complex systems. Springer series: advances in intelligent systems and computing, vol 210, pp 47–59

  • Zelinka I, Senkerik R, Pluhacek M (2013c) Do evolutionary algorithms indeed require randomness? In: IEEE congress on evolutionary computation, Cancun. (In print)

  • Zelinka I, Davendra D, Senkerik R, Jasek R, Oplatkova Z (2011) Analytical programming—a novel approach for evolutionary synthesis of symbolic structures, evolutionary algorithms. In: Prof. Kita E (ed) ISBN 978-953-307-171-8, InTech. https://doi.org/10.5772/16166. http://www.intechopen.com/books/evolutionary-algorithms/analytical-programming-a-novel-approach-for-evolutionary-synthesis-of-symbolic-structures

Download references

Acknowledgements

The following grants are acknowledged for the financial support provided for this research: Grant Agency of the Czech Republic GACR P103/15/06700S, Grant of SGS No. SGS 2018/177, VSB-Technical University of Ostrava, by the Ministry of Education, Youth and Sports of the Czech Republic within the National Sustainability Programme Project no. LO1303 (MSMT-7778/2014), further by the European Regional Development Fund under the Project CEBIA-Tech no. CZ.1.05/2.1.00/03.0089. This work is also based upon support by COST Action CA15140, Improving Applicability of Nature-Inspired Optimisation by Joining Theory and Practice (ImAppNIO).

Author information

Authors and Affiliations

  1. Modeling Evolutionary Algorithms Simulation and Artificial Intelligence, Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City, Vietnam

    Ivan Zelinka

  2. Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VSB-Technical University of Ostrava, Ostrava, Czech Republic

    Ivan Zelinka

  3. Department of Computer Science, Faculty of Technology, University of Vaasa, Yliopistonranta 10, 65200, Vaasa, Finland

    Jouni Lampinen

  4. Department of Informatics and Artificial Intelligence, FAI, Tomas Bata Univerzity in Zlin, Nam. T.G. Masaryka 5555, 760 01, Zlin, Czech Republic

    Roman Senkerik & Michal Pluhacek

Authors
  1. Ivan Zelinka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jouni Lampinen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roman Senkerik
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michal Pluhacek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Zelinka.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zelinka, I., Lampinen, J., Senkerik, R. et al. Investigation on evolutionary algorithms powered by nonrandom processes. Soft Comput 22, 1791–1801 (2018). https://doi.org/10.1007/s00500-015-1689-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-015-1689-2

Keywords

Search

Navigation