Accelerating Real-Valued Genetic Algorithms Using Mutation-With-Momentum
Temby, L and Vamplew, P and Berry, A (2005) Accelerating Real-Valued Genetic Algorithms Using Mutation-With-Momentum. Technical Report. Springer.
|PDF - Requires a PDF viewer|
In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven purely by the bias to fitter individuals in the selection process. Several authors have proposed the use of directed mutation operators as a means of improving the convergence speed of GAs on problems involving real-valued alleles. This paper proposes a new approach to directed mutation based on the momentum concept commonly used to accelerate the gradient descent training of neural networks. This mutation-with-momentum operator is compared against standard Gaussian mutation across a series of benchmark problems, and is shown to regularly result in rapid improvements in performance during the early generations of the GA. A hybrid system combining the momentum-based and standard mutation operators is shown to outperform either individual approach to mutation across all of the benchmarks.
|Item Type:||Report (Technical Report)|
|Additional Information:||This report is an extended version of a paper of the same title presented at AI'05: The 18th Australian Joint Conference on Artificial Intelligence, Sydney, Australia, 5-9 Dec 2005.The proceedings of this conference are published as part of the Springer Lecture Notes in Computer Science series, and are available from http://www.springeronline.com/lncs|
|Keywords:||Genetic algorithms, evolutionary computation, mutation operators, momentum|
|Deposited By:||utas eprints|
|Deposited On:||15 Sep 2005|
|Last Modified:||18 Jul 2008 19:39|
|ePrint Statistics:||View statistics for this ePrint|
Repository Staff Only: item control page