Academic
Publications
Markov Random Field Modelling of Royal Road Genetic Algorithms

Markov Random Field Modelling of Royal Road Genetic Algorithms,10.1007/3-540-46033-0_6,Deryck F. Brown,A. Beatriz Garmendia-doval,John A. W. Mccall

Markov Random Field Modelling of Royal Road Genetic Algorithms   (Citations: 15)
BibTex | RIS | RefWorks Download
Markov Random Fields (MRFs) [5] are a class of probabalistic models that have been applied for many years to the analysis of visual patterns or textures. In this paper, our objective is to establish MRFs as an interesting approach to modelling genetic algorithms. Our approach bears strong similarities to recent work on the Bayesian Optimisation Algorithm [9], but there are also some significant differences. We establish a theoretical result that every genetic algorithm problem can be characterised in terms of a MRF model. This allows us to construct an explicit probabilistic model of the GA fitness function. The model can be used to generate chromosomes, and derive a MRF fitness measure for the population. We then use a specific MRF model to analyse two Royal Road problems, relating our analysis to that of Mitchell et al. [7].
Conference: Artificial Evolution - AE , pp. 65-76, 2001
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: