Stable Mutations for Evolutionary Algorithms
- Indbinding:
- Hardback
- Sideantal:
- 164
- Udgivet:
- 11. oktober 2018
- Udgave:
- 12019
- Vægt:
- 442 g.
- 8-11 hverdage.
- 16. januar 2025
På lager
Forlænget returret til d. 31. januar 2025
Normalpris
Abonnementspris
- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
Beskrivelse af Stable Mutations for Evolutionary Algorithms
This book presents a set of theoretical and experimental results that describe the features of the wide family of a-stable distributions (the normal distribution also belongs to this class) and their various applications in the mutation operator of evolutionary algorithms based on real-number representation of the individuals, and, above all, equip these algorithms with features that enrich their effectiveness in solving multi-modal, multi-dimensional global optimization problems. The overall conclusion of the research presented is that the appropriate choice of probabilistic model of the mutation operator for an optimization problem is crucial.Mutation is one of the most important operations in stochastic global optimization algorithms in the n-dimensional real space. It determines the method of search space exploration and exploitation. Most applications of these algorithms employ the normal mutation as a mutation operator. This choice is justified by the central limit theorem but is associated with a set of important limitations. Application of a-stable distributions allows more flexible evolutionary models to be obtained than those with the normal distribution. The book presents theoretical analysis and simulation experiments, which were selected and constructed to expose the most important features of the examined mutation techniques based on a-stable distributions. It allows readers to develop a deeper understanding of evolutionary processes with stable mutations and encourages them to apply these techniques to real-world engineering problems.
Brugerbedømmelser af Stable Mutations for Evolutionary Algorithms
Giv din bedømmelse
For at bedømme denne bog, skal du være logget ind.Andre købte også..
Find lignende bøger
Bogen Stable Mutations for Evolutionary Algorithms findes i følgende kategorier:
© 2024 Pling BØGER Registered company number: DK43351621