Skip to main content
Erschienen in: Memetic Computing 3/2021

28.07.2021 | Regular research paper

Linear prediction evolution algorithm: a simplest evolutionary optimizer

verfasst von: Cong Gao, Zhongbo Hu, Wangyu Tong

Erschienen in: Memetic Computing | Ausgabe 3/2021

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The prediction-based evolutionary algorithms are a recently developed branch of metaheuristic algorithms. The most notable feature of this kind of algorithms is the use of a certain prediction model to develop their reproduction operators for evolution. The linear least square fitting model, as a simplest and most widely used statistic model, is first introduced to construct a linear prediction evolution algorithm (LPE) in this paper. Firstly, the proposed LPE randomly selects three individuals from three consecutive populations, respectively, and then fits a line on each dimension of the three individuals by using the linear least square fitting model. Finally, LPE regards the line expression as its reproduction operator to generate the offspring individuals. LPE algorithm does not have any control parameters except for a population size. Its reproduction operator based on the linear least square fitting model holds solid mathematical foundation without any empirical coefficients, and is theoretically proven to be adaptive to the variation of population regions. The effectiveness of the proposed LPE is validated on CEC2014, CEC2017 benchmark functions and a comprehensive set of seven engineering design problems. The comparison experiments indicate that LPE is a competitive optimizer compared with other state-of-the-art algorithms.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Dulebenets Maxim A (2020) An adaptive island evolutionary algorithm for the berth scheduling problem. Memet Comput 12(1):51–72CrossRef Dulebenets Maxim A (2020) An adaptive island evolutionary algorithm for the berth scheduling problem. Memet Comput 12(1):51–72CrossRef
2.
Zurück zum Zitat Muthuswamy S, Lam Sarah S (2011) Discrete particle swarm optimization for the team orienteering problem. Memet Comput 3(4):287–303CrossRef Muthuswamy S, Lam Sarah S (2011) Discrete particle swarm optimization for the team orienteering problem. Memet Comput 3(4):287–303CrossRef
3.
Zurück zum Zitat Holland JH et al (1975) Adaptation in natural and artificial systems. An introductory analysis with applications to biology, control and artificial intelligence. University of Michigan Press, Ann Arbor Holland JH et al (1975) Adaptation in natural and artificial systems. An introductory analysis with applications to biology, control and artificial intelligence. University of Michigan Press, Ann Arbor
4.
Zurück zum Zitat Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359MathSciNetMATHCrossRef Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359MathSciNetMATHCrossRef
6.
Zurück zum Zitat Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248MATHCrossRef Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248MATHCrossRef
7.
Zurück zum Zitat Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, Perth, Australia, pp 1942–1948 Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, Perth, Australia, pp 1942–1948
8.
Zurück zum Zitat Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459–471MathSciNetMATHCrossRef Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459–471MathSciNetMATHCrossRef
9.
Zurück zum Zitat Larrañaga P, Lozano JA (2001) Estimation of distribution algorithms: a new tool for evolutionary computation, vol 2. Springer Science & Business Media Larrañaga P, Lozano JA (2001) Estimation of distribution algorithms: a new tool for evolutionary computation, vol 2. Springer Science & Business Media
10.
Zurück zum Zitat Hansen N, Ostermeier A (1996) Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of IEEE international conference on evolutionary computation, pp 312–317. IEEE Hansen N, Ostermeier A (1996) Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of IEEE international conference on evolutionary computation, pp 312–317. IEEE
11.
Zurück zum Zitat Buche D, Schraudolph NN, Koumoutsakos P (2005) Accelerating evolutionary algorithms with Gaussian process fitness function models. IEEE Trans Syst Man Cybern Part C Appl Rev 35(2):183–194CrossRef Buche D, Schraudolph NN, Koumoutsakos P (2005) Accelerating evolutionary algorithms with Gaussian process fitness function models. IEEE Trans Syst Man Cybern Part C Appl Rev 35(2):183–194CrossRef
12.
Zurück zum Zitat Zhongbo H, Xinlin X, Qinghua S, Zhu H, Guo J (2020) Grey prediction evolution algorithm for global optimization. Appl Math Model 79:145–160MathSciNetMATHCrossRef Zhongbo H, Xinlin X, Qinghua S, Zhu H, Guo J (2020) Grey prediction evolution algorithm for global optimization. Appl Math Model 79:145–160MathSciNetMATHCrossRef
13.
Zurück zum Zitat Hu Z, Gao C, Qinghua S (2021) A novel evolutionary algorithm based on even difference grey model. Expert Syst Appl 114898 Hu Z, Gao C, Qinghua S (2021) A novel evolutionary algorithm based on even difference grey model. Expert Syst Appl 114898
14.
Zurück zum Zitat Xinlin X, Zhongbo H, Qinghua S, Li Y, Dai J (2020) Multivariable grey prediction evolution algorithm: a new metaheuristic. Appl Soft Comput 89:106086CrossRef Xinlin X, Zhongbo H, Qinghua S, Li Y, Dai J (2020) Multivariable grey prediction evolution algorithm: a new metaheuristic. Appl Soft Comput 89:106086CrossRef
15.
Zurück zum Zitat Gao C, Zhongbo H, Xiong Z, Qinghua S (2020) Grey prediction evolution algorithm based on accelerated even grey model. IEEE Access 8:107941–107957CrossRef Gao C, Zhongbo H, Xiong Z, Qinghua S (2020) Grey prediction evolution algorithm based on accelerated even grey model. IEEE Access 8:107941–107957CrossRef
16.
Zurück zum Zitat Dai C, Zhongbo H, Li Z, Xiong Z, Qinghua S (2020) An improved grey prediction evolution algorithm based on topological opposition-based learning. IEEE Access 8:30745–30762CrossRef Dai C, Zhongbo H, Li Z, Xiong Z, Qinghua S (2020) An improved grey prediction evolution algorithm based on topological opposition-based learning. IEEE Access 8:30745–30762CrossRef
17.
Zurück zum Zitat Zhongbo H, Li Z, Dai C, Xinlin X, Xiong Z, Qinghua S (2020) Multiobjective grey prediction evolution algorithm for environmental/economic dispatch problem. IEEE Access 8:84162–84176CrossRef Zhongbo H, Li Z, Dai C, Xinlin X, Xiong Z, Qinghua S (2020) Multiobjective grey prediction evolution algorithm for environmental/economic dispatch problem. IEEE Access 8:84162–84176CrossRef
18.
Zurück zum Zitat Zhou T, Zhongbo H, Zhou Q, Yuan S (2021) A novel grey prediction evolution algorithm for multimodal multiobjective optimization. Eng Appl Artif Intell 100:104173CrossRef Zhou T, Zhongbo H, Zhou Q, Yuan S (2021) A novel grey prediction evolution algorithm for multimodal multiobjective optimization. Eng Appl Artif Intell 100:104173CrossRef
20.
Zurück zum Zitat Rao R (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7(1):19–34 Rao R (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7(1):19–34
21.
Zurück zum Zitat Wang G-G (2018) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memet Comput 10(2):151–164CrossRef Wang G-G (2018) Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memet Comput 10(2):151–164CrossRef
22.
Zurück zum Zitat Liang J, Qu B, Suganthan PN (2013) Problem definitions and evaluation criteria for the CEC2014 special session and competition on single objective real-parameter numerical optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore, p 635 Liang J, Qu B, Suganthan PN (2013) Problem definitions and evaluation criteria for the CEC2014 special session and competition on single objective real-parameter numerical optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore, p 635
23.
Zurück zum Zitat Awad NH , Ali MZ, Nagaratnam SP, Jing L, Boyang Q (2016) Problem definitions and evaluation criteria for the CEC2017 special session and competition on single objective bound constrained real-parameter numerical optimization. Technical Report Awad NH , Ali MZ, Nagaratnam SP, Jing L, Boyang Q (2016) Problem definitions and evaluation criteria for the CEC2017 special session and competition on single objective bound constrained real-parameter numerical optimization. Technical Report
24.
Zurück zum Zitat Zeng G-Q, Xie X-Q, Chen M-R, Weng J (2019) Adaptive population extremal optimization-based PID neural network for multivariable nonlinear control systems. Swarm Evol Comput 44:320–334CrossRef Zeng G-Q, Xie X-Q, Chen M-R, Weng J (2019) Adaptive population extremal optimization-based PID neural network for multivariable nonlinear control systems. Swarm Evol Comput 44:320–334CrossRef
25.
Zurück zum Zitat Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18CrossRef Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3–18CrossRef
26.
Zurück zum Zitat Price KV, Awad NH, Ali MZ, Suganthan PN (2018) Problem definitions and evaluation criteria for the 100-digit challenge special session and competition on single objective numerical optimization. In Technical Report. Nanyang Technological University Price KV, Awad NH, Ali MZ, Suganthan PN (2018) Problem definitions and evaluation criteria for the 100-digit challenge special session and competition on single objective numerical optimization. In Technical Report. Nanyang Technological University
27.
Zurück zum Zitat Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169:1–12CrossRef Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169:1–12CrossRef
28.
Zurück zum Zitat Jaberipour M, Khorram E (2010) Two improved harmony search algorithms for solving engineering optimization problems. Commun Nonlinear Sci Numer Simul 15(11):3316–3331MATHCrossRef Jaberipour M, Khorram E (2010) Two improved harmony search algorithms for solving engineering optimization problems. Commun Nonlinear Sci Numer Simul 15(11):3316–3331MATHCrossRef
29.
Zurück zum Zitat Zhang C, Lin Q, Gao L, Li X (2015) Backtracking search algorithm with three constraint handling methods for constrained optimization problems. Expert Syst Appl 42(21):7831–7845CrossRef Zhang C, Lin Q, Gao L, Li X (2015) Backtracking search algorithm with three constraint handling methods for constrained optimization problems. Expert Syst Appl 42(21):7831–7845CrossRef
30.
Zurück zum Zitat Wang L, Li L (2010) An effective differential evolution with level comparison for constrained engineering design. Struct Multidiscip Optim 41(6):947–963CrossRef Wang L, Li L (2010) An effective differential evolution with level comparison for constrained engineering design. Struct Multidiscip Optim 41(6):947–963CrossRef
31.
Zurück zum Zitat Liu H, Cai Z, Wang Y (2010) Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Appl Soft Comput 10(2):629–640CrossRef Liu H, Cai Z, Wang Y (2010) Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization. Appl Soft Comput 10(2):629–640CrossRef
32.
Zurück zum Zitat Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178(15):3043–3074CrossRef Zhang M, Luo W, Wang X (2008) Differential evolution with dynamic stochastic selection for constrained optimization. Inf Sci 178(15):3043–3074CrossRef
33.
Zurück zum Zitat Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13(5):2592–2612CrossRef Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput 13(5):2592–2612CrossRef
34.
Zurück zum Zitat Wang Y, Cai Z, Zhou Y, Fan Z (2009) Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint-handling technique. Struct Multidiscip Optim 37(4):395–413CrossRef Wang Y, Cai Z, Zhou Y, Fan Z (2009) Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint-handling technique. Struct Multidiscip Optim 37(4):395–413CrossRef
35.
Zurück zum Zitat Baykasoğlu A, Ozsoydan FB (2015) Adaptive firefly algorithm with chaos for mechanical design optimization problems. Appl Soft Comput 36:152–164 Baykasoğlu A, Ozsoydan FB (2015) Adaptive firefly algorithm with chaos for mechanical design optimization problems. Appl Soft Comput 36:152–164
36.
Zurück zum Zitat Coello CAC (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41(2):113–127CrossRef Coello CAC (2000) Use of a self-adaptive penalty approach for engineering optimization problems. Comput Ind 41(2):113–127CrossRef
37.
Zurück zum Zitat Coello CA, Efrén CM, Mezura, (2002) Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv Eng Inf 16(3):193–203 Coello CA, Efrén CM, Mezura, (2002) Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv Eng Inf 16(3):193–203
38.
Zurück zum Zitat He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20(1):89–99CrossRef He Q, Wang L (2007) An effective co-evolutionary particle swarm optimization for constrained engineering design problems. Eng Appl Artif Intell 20(1):89–99CrossRef
39.
Zurück zum Zitat He Q, Wang L (2007) A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl Math Comput 186(2):1407–1422MathSciNetMATH He Q, Wang L (2007) A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization. Appl Math Comput 186(2):1407–1422MathSciNetMATH
40.
Zurück zum Zitat Wang H, Zhongbo H, Sun Y, Qinghua S, Xia X (2019) A novel modified BSA inspired by species evolution rule and simulated annealing principle for constrained engineering optimization problems. Neural Comput Appl 31(8):4157–4184CrossRef Wang H, Zhongbo H, Sun Y, Qinghua S, Xia X (2019) A novel modified BSA inspired by species evolution rule and simulated annealing principle for constrained engineering optimization problems. Neural Comput Appl 31(8):4157–4184CrossRef
41.
Zurück zum Zitat Huang F, Wang L, He Q (2007) An effective co-evolutionary differential evolution for constrained optimization. Appl Math Comput 186(1):340–356MathSciNetMATH Huang F, Wang L, He Q (2007) An effective co-evolutionary differential evolution for constrained optimization. Appl Math Comput 186(1):340–356MathSciNetMATH
42.
Zurück zum Zitat Mezuramontes E, Coello CAC, Jesús V (2006) Increasing successful offspring and diversity in differential evolution for engineering design. In: Proceedings of the seventh international conference on adaptive computing in design and manufacture (ACDM 2006), pp 131–139 Mezuramontes E, Coello CAC, Jesús V (2006) Increasing successful offspring and diversity in differential evolution for engineering design. In: Proceedings of the seventh international conference on adaptive computing in design and manufacture (ACDM 2006), pp 131–139
43.
Zurück zum Zitat Cuevas E, Cienfuegos M (2014) A new algorithm inspired in the behavior of the social-spider for constrained optimization. Expert Syst Appl 41(2):412–425CrossRef Cuevas E, Cienfuegos M (2014) A new algorithm inspired in the behavior of the social-spider for constrained optimization. Expert Syst Appl 41(2):412–425CrossRef
44.
Zurück zum Zitat Ozsoydan FB, İ Gölcük. (2020) Cuckoo search algorithm with various walks. In: Applications of Cuckoo Search Algorithm and its Variants, pp 47–77. Springer Ozsoydan FB, İ Gölcük. (2020) Cuckoo search algorithm with various walks. In: Applications of Cuckoo Search Algorithm and its Variants, pp 47–77. Springer
45.
Zurück zum Zitat Civicioglu P (2013) Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput 219(15):8121–8144MathSciNetMATH Civicioglu P (2013) Backtracking search optimization algorithm for numerical optimization problems. Appl Math Comput 219(15):8121–8144MathSciNetMATH
46.
Zurück zum Zitat Kanagaraj G, Ponnambalam SG, Gandomi AH (2015) Hybridizing cuckoo search with bio-inspired algorithms for constrained optimization problems. In: International conference on swarm, evolutionary, and memetic computing, pp 260–273. Springer Kanagaraj G, Ponnambalam SG, Gandomi AH (2015) Hybridizing cuckoo search with bio-inspired algorithms for constrained optimization problems. In: International conference on swarm, evolutionary, and memetic computing, pp 260–273. Springer
47.
Zurück zum Zitat Akay B, Karaboga D (2012) Artificial bee colony algorithm for large-scale problems and engineering design optimization. J Intell Manuf 23(4):1001–1014CrossRef Akay B, Karaboga D (2012) Artificial bee colony algorithm for large-scale problems and engineering design optimization. J Intell Manuf 23(4):1001–1014CrossRef
48.
Zurück zum Zitat Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowledge-Based Syst 89:228–249CrossRef Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowledge-Based Syst 89:228–249CrossRef
49.
Zurück zum Zitat Cheng M, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112CrossRef Cheng M, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112CrossRef
50.
Zurück zum Zitat Svanberg K (1987) The method of moving asymptotes-a new method for structural optimization. Int J Numer Methods Eng 24(2):359–373MathSciNetMATHCrossRef Svanberg K (1987) The method of moving asymptotes-a new method for structural optimization. Int J Numer Methods Eng 24(2):359–373MathSciNetMATHCrossRef
51.
Zurück zum Zitat Chickermane H, Gea H (1996) Structural optimization using a new local approximation method. Int J Numer Methods Eng 39(5):829–846MathSciNetMATHCrossRef Chickermane H, Gea H (1996) Structural optimization using a new local approximation method. Int J Numer Methods Eng 39(5):829–846MathSciNetMATHCrossRef
52.
Zurück zum Zitat Mirjalili S, Seyed MM, Hatamlou A (2016) Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput Appl 27(2):495–513CrossRef Mirjalili S, Seyed MM, Hatamlou A (2016) Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput Appl 27(2):495–513CrossRef
53.
Zurück zum Zitat Xue Yu, Xue B, Zhang M (2019) Self-adaptive particle swarm optimization for large-scale feature selection in classification. ACM Trans Knowl Discov Data (TKDD) 13(5):1–27CrossRef Xue Yu, Xue B, Zhang M (2019) Self-adaptive particle swarm optimization for large-scale feature selection in classification. ACM Trans Knowl Discov Data (TKDD) 13(5):1–27CrossRef
54.
Zurück zum Zitat Xinlin X, Zhongbo H, Qinghua S, Zenggang X (2018) Multiobjective collective decision optimization algorithm for economic emission dispatch problem. Complexity Xinlin X, Zhongbo H, Qinghua S, Zenggang X (2018) Multiobjective collective decision optimization algorithm for economic emission dispatch problem. Complexity
55.
Zurück zum Zitat Bing X, Mengjie Z, Browne Will N, Xin Y (2015) A survey on evolutionary computation approaches to feature selection. IEEE Trans Evol Comput 20(4):606–626 Bing X, Mengjie Z, Browne Will N, Xin Y (2015) A survey on evolutionary computation approaches to feature selection. IEEE Trans Evol Comput 20(4):606–626
56.
Zurück zum Zitat Zhang Y, Gong D, Cheng J (2015) Multi-objective particle swarm optimization approach for cost-based feature selection in classification. IEEE/ACM Trans Comput Biol Bioinformatics 14(1):64–75CrossRef Zhang Y, Gong D, Cheng J (2015) Multi-objective particle swarm optimization approach for cost-based feature selection in classification. IEEE/ACM Trans Comput Biol Bioinformatics 14(1):64–75CrossRef
Metadaten
Titel
Linear prediction evolution algorithm: a simplest evolutionary optimizer
verfasst von
Cong Gao
Zhongbo Hu
Wangyu Tong
Publikationsdatum
28.07.2021
Verlag
Springer Berlin Heidelberg
Erschienen in
Memetic Computing / Ausgabe 3/2021
Print ISSN: 1865-9284
Elektronische ISSN: 1865-9292
DOI
https://doi.org/10.1007/s12293-021-00340-x

Weitere Artikel der Ausgabe 3/2021

Memetic Computing 3/2021 Zur Ausgabe