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

DOI10.1007/s00180-014-0526-xzbMath1342.65057OpenAlexW2162431681MaRDI QIDQ736997

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

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

Markov chainsmodel selectiontime seriesmaximum likelihoodevolutionary 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)

Related Items

Unnamed Item, On the convergence rate of the elitist genetic algorithm based on mutation probability, Statistical and computational tradeoff in genetic algorithm-based estimation

Uses Software

• TDSL
• Genocop
• TSDL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A large population size can be unhelpful in evolutionary algorithms
• Genetic algorithms with shrinking population size
• A genetic algorithm with fuzzy crossover operator and probability
• Global optimization and stochastic differential equations
• Quantitative bounds on convergence of time-inhomogeneous Markov chains
• On the convergence rates of genetic algorithms
• On maximization of the likelihood for the generalized gamma distribution
• A new approach to estimating the expected first hitting time of evolutionary algorithms
• The elitist non-homogeneous genetic algorithm: almost sure convergence
• Bimodal symmetric-asymmetric power-normal families
• Computational Statistics
• Global optimization