Introduces the compact genetic algorithm (cGA) which represents the population as a probability distribution over the set of solutions and is operationally equivalent to the order-one behavior of the simple GA with uniform crossover.Expand

This paper summarizes the research on population-based probabilistic search algorithms based on modeling promising solutions by estimating their probability distribution and using the constructed model to guide the exploration of the search space.Expand

This book gives the reader a solid perspective on the different approaches that have been proposed to automate control of these parameters as well as understanding their interactions.Expand

This chapter explores the relationship between the linkage-learning problem and that of learning probability distributions over multi-variate spaces.Expand

Proceedings of IEEE International Conference onâ€¦

13 April 1997

TLDR

We present a model for hybridizing genetic algorithms (GAs) based on a concept that decision theorists call probability matching and we use it to combine an elitist selecto-recombinative GA with a simple hill climber (HC).Expand

Land-use management problem/practice may be defined as the process of allocating different competitive land uses/activities, such as agriculture, forest, industries, recreational activities or conservation, to different units of a landscape to meet the desired objectives of land managers.Expand

This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks.Expand