We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...
Several researchers have used Price’s equation (from biology theory literature) to analyze the various components of an Evolutionary Algorithm (EA) while it is running, giving i...
Jeffrey K. Bassett, Mitchell A. Potter, Kenneth A....
We propose a selection scheme called Fitness-based Neighbor Selection (FNS) for multimodal optimization. The FNS is aimed for ill-scaled and locally multimodal domain, both found ...
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
Because of the large number of possible combinations for the fuel assembly loading in the core, the design of the loading pattern (LP) is a complex optimization problem. It requir...
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
Superresolution is the process of producing a high resolution image from a collection of low resolution images. This process has potential application in a wide spectrum of fields...
This paper offers practical design-guidelines for developing efficient genetic algorithms (GAs) to successfully solve realworld problems. As an important design component, a prac...
Chang Wook Ahn, Sanghoun Oh, Rudrapatna S. Ramakri...
A Genetic Algorithm for graphical pattern matching based on angle matching had been proposed. It has proven quite effective in matching simple patterns. However, the algorithm nee...