A Survey of Hybrid Genetic and Evolutionary Algorithms
Sinha, A., Goldberg, D. E. (2003)TR No.: 2003004 | Download PDF | Download PS
Abstract:
Hybrids of genetic and evolutionary algorithms with other methods have drawn much attention over the past decade. We present an overview of the developments in the theory and practice of genetic and evolutionary algorithm hybrids. Motivation for such hybrids is highlighted and a taxonomy is proposed. A summary of applications of these hybrids indicating […]
Posted: April 4th, 2003 under Genetic algorithms. Comments: none
Distributed Innovation and Scalable Collaboration In Uncertain Settings
Goldberg, D. E., Welge, M., Llorà, X. (2003)TR No.: 2003017 | Download PDF | Download PS
Abstract:
A key challenge facing modern organizations and their leaders is the need for rapid innovation in response to complex circumstances and rapidly
changing events. The modern organization may have vast amounts of data, knowledge, and expertise to address problems and opportunities at hand, but the sheer quantity, uncertainty, and spatial distribution of those resources may […]
Posted: March 24th, 2003 under Genetic algorithms. Comments: none
Evolutionary Weight Tuning for Unit Selection Based on Diphone Pairs
Francesc Alías and Xavier Llorà (2003)TR No.: 2003018 | Download PDF | Download PS
Abstract:
Unit selection text-to-speech (TTS) conversion is an ongoing research for the speech synthesis community. This paper is focused on tuning the weights involved in the target and concatenation cost metrics. We propose a method for automatically adjusting these weights simultaneously by means of diphone and triphone pairs. This method is based on techniques provided by […]
Posted: March 20th, 2003 under Genetic algorithms. Comments: none
On the Optimal Communication Spanning Tree Problem
Rothlauf, F., Gerstacker, J., Heinzl A. (2003)TR No.: 2003015 | Download PDF | Download PS
Abstract:
This paper presents an investigation into the properties of the optimal communication spanning tree (OCST) problem. The OCST problem finds a spanning tree that connects all nodes and satisfies their communication requirements for a minimum total cost. The paper compares the properties of randomly created solutions to the best solutions that are found using […]
Posted: March 16th, 2003 under Genetic algorithms. Comments: none
Multiple-deme Parallel Estimation of Distribution Algorithms: Basic Framework and Application
Ahn, C.-W., Goldberg, D. E., Ramakrishna, R. S. (2003)TR No.: 2003016 | Download PDF | Download PS
Abstract:
This paper presents a basic framework that facilitates the development of new multiple-deme parallel estimation of distribution algorithms (PEDAs). The aim is to carry over the migration effect that arises in multiple-deme parallel genetic
algorithms (PGAs) into probability distribution of EDAs. The idea is to employ two probability vectors (PVs): one each for resident and immigrant
candidates. […]
Posted: March 12th, 2003 under Genetic algorithms. Comments: none
Genetic Programming for Multi-Timescale Modeling
Sastry, K. Johnson, D. D., Goldberg, D. E., Bellon, P. (2003)TR No.: 2003014 | Download PDF | Download PS
Abstract:
A bottleneck for multi-timescale modeling is the computation of activation
energies (or potential energy surface, PES). We explore the use of genetic
programming (GP)—a genetic algorithm that evolves computer programs—to perform symbolic regression to create a local mapping of the activation energy for any possible configuration, thereby avoiding explicit calculation of the entire PES. To exemplify the […]
Posted: March 8th, 2003 under Genetic algorithms. Comments: none
Probabilistic Model Building and Competent Genetic Programming
Sastry, K., Goldberg, D. E. (2003)TR No.: 2003013 | Download PDF | Download PS
Abstract:
This paper describes a probabilistic model building genetic programming (PMBGP) developed based on the extended compact genetic algorithm (eCGA). Unlike traditional genetic programming, which use fixed recombination operators, the proposed PMBGA adapts linkages. The proposed algorithms, called the extended compact genetic programming (eCGP) adaptively identifies and exchanges non-overlapping building blocks by constructing and sampling probabilistic […]
Posted: March 4th, 2003 under Genetic algorithms. Comments: none
Building-Block Supply in Genetic Programming
Sastry, K. O'Reilly, U.-M., Goldberg, D. E., Hill, D. J. (2003)TR No.: 2003012 | Download PDF | Download PS
Abstract:
This paper analyzes building block supply in the initial population for genetic programming. Facetwise models for the supply of a single schema as well as for the supply of all schemas in a partition are developed. An estimate for the population size, given the size (or size distribution) of trees, that ensures the presence of […]
Posted: February 24th, 2003 under Genetic algorithms. Comments: none
Bounding the effect of noise in Multiobjective Learning Classifier Systems
Llorà, X., Goldberg, D. E. (2003)TR No.: 2003011 | Download PDF | Download PS
Abstract:
This paper analyzes the impact of using noisy data sets in Pittsburgh-style learning classifier systems. This study was done using a particular kind of learning classifier system based on multiobjective selection. Our goal was to characterize the behavior of this kind of algorithms when dealing with noisy domains. For this reason, we developed a […]
Posted: February 20th, 2003 under Genetic algorithms. Comments: none
Genetic Algorithms at the University of Illinois Fall 2002
Goldberg, D. E. (ed.) (2003)TR No.: 2003010 | Download PDF | Download PS
Abstract:
Related PostsGenetic Algorithms at the University of Illinois Fall 1999Genetic Algorithms at the University of Illinois Fall 2000Genetic Algorithms at the University of Illinois Fall 2001
Posted: February 16th, 2003 under Genetic algorithms. Comments: none