Abstract
This paper examines the influence of mutation on the behavior of genetic algorithms through a series of examples and experiments. The results provide an existence proof that mutation is a far more profound operator than has ever been recognized. Implications are discussed which point to the importance of open questions concerning genetic algorithms. The paper also reviews the implementation of the infinite population model of Vose which forms the computational basis of this investigation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.E. Goldberg, Simple genetic algorithms and the minimal, deceptive problem, in:Genetic Algorithms and Simulated Annealing, ed. L. Davis (Pitman, London, 1987) pp. 74–88.
A. Nix and M.D. Vose, Modeling genetic algorithms with Markov chains, Ann. Math. and AI 5 (1992) 79–88.
M.D. Vose, Formalizing genetic algorithms,Proc. IEEE Workshop G.A.s, N.N.s, & S.A. Appl. to Prob, in S. & I. Processing, Glasgow, U.K., May 1990.
M.D. Vose and G.E. Liepins, Punctuated equilibria in genetic search, Complex Syst. 5 (1991) 31–44.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Vose, M.D. A closer look at mutation in genetic algorithms. Ann Math Artif Intell 10, 423–434 (1994). https://doi.org/10.1007/BF01531279
Issue Date:
DOI: https://doi.org/10.1007/BF01531279