On the genetic algorithm with adaptive mutation rate and selected statistical applications

DOI10.1007/S00180-014-0526-XMaRDI QIDQ736997zbMATH OpenOpenAlexFDO

Authors André G. Pereira, Bernardo B. de Andrade

Publication date 5 August 2016

Published in Computational Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00180-014-0526-x

zbMATH Keywords

model selectionmaximum likelihoodtime seriesMarkov chainsevolutionary algorithms

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1552335
• A new genetic algorithm specifically based on mutation and selection
• Optimal mutation probability for genetic algorithms
• An upper bound on the convergence rates of canonical genetic algorithms
• Theory of genetic algorithms

Cites work

• scientific article; zbMATH DE number 2130220 (Why is no real title available?)
• scientific article; zbMATH DE number 107465 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3519671 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 842531 (Why is no real title available?)
• A genetic algorithm with fuzzy crossover operator and probability
• A large population size can be unhelpful in evolutionary algorithms
• A new approach to estimating the expected first hitting time of evolutionary algorithms
• Bimodal symmetric-asymmetric power-normal families
• Computational statistics
• Genetic algorithms with shrinking population size
• Global optimization
• Global optimization and stochastic differential equations
• On maximization of the likelihood for the generalized gamma distribution
• On the convergence rates of genetic algorithms
• Quantitative bounds on convergence of time-inhomogeneous Markov chains
• The elitist non-homogeneous genetic algorithm: almost sure convergence

Cited in

(6)

• Statistical and computational tradeoff in genetic algorithm-based estimation
• scientific article; zbMATH DE number 2040700 (Why is no real title available?)
• On the convergence rate of the elitist genetic algorithm based on mutation probability
• Intelligent mutation rate control in an economic application of genetic algorithms
• scientific article; zbMATH DE number 7149438 (Why is no real title available?)
• GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS

Describes a project that uses

Uses Software

• TDSL
• Genocop
• TSDL

This page was built for publication: On the genetic algorithm with adaptive mutation rate and selected statistical applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736997)