Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)

19-23 June 2004

Go

Filter Results

Displaying Results 1 - 25 of 176
  • Clonal selection algorithm with operator multiplicity

    Publication Year: 2004, Page(s):1909 - 1915 Vol.2
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (574 KB) | HTML iconHTML

    An artificial immune system using the clonal selection principle with multiple hypermutation operators in its implementation is presented. Mutation operators to be used are identified initially. In every mutation operation, the fitness gain achieved by the employed mutation operator is computed and stored. Accordingly, mutation operators are assigned fitness values based on the fitness improvement... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new cellular automaton: five elements balance chart and its application to forest industry ecosystem

    Publication Year: 2004, Page(s):1901 - 1908 Vol.2
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (537 KB) | HTML iconHTML

    We propose a new cellular automaton, i.e. five elements balance chart, based on the theory of five elements, which is one of the most important parts of traditional Chinese philosophy. There are five kinds of basic elements in five elements balance chart, i.e. wood, fire, earth, metal, and water. Ancient Chinese thought used the relations of creating and controlling within the five elements to ana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fredkin gate circuits via recombination enzymes

    Publication Year: 2004, Page(s):1896 - 1900 Vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (326 KB) | HTML iconHTML

    Using DNA, Fredkin gates are constructed whose outputs are used as inputs for other Fredkin gates. Each gate is designed to operate at a particular time step, although many different gates can operate simultaneously. Thus, arbitrary circuits of Fredkin gates can be constructed, including computers. An example application is given: a depth-two decision tree circuit that directs control and data fro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Soundness and quality of semantic retrieval in DNA-based memories with abiotic data

    Publication Year: 2004, Page(s):1889 - 1895 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (635 KB) | HTML iconHTML

    Associative memories based on DNA-affinity have been proposed based in L. M. Adleman (1994) and E. Baum (1995). Previously, we have quantified the quality of retrieval of genomic information in simulation as stated in M. Garzon et al. (2003). Here, the ability of two types of DNA-based memories to store abiotic data and retrieve semantic information is evaluated for soundness and compared to state... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of noise on the performance of cultural evolution in multi-agent systems

    Publication Year: 2004, Page(s):1767 - 1773 Vol.2
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (470 KB) | HTML iconHTML

    This work examines the effect of the addition of noise to the cultural learning process of a population of agents. Experiments are undertaken using an artificial life simulator capable of simulating population learning (through the use of genetic algorithms) and lifetime learning (through the use of neural networks). To simulate cultural learning, (the exchange of information through nongenetic me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Swarm guidance using a multi-objective co-evolutionary on-Line evolutionary algorithm

    Publication Year: 2004, Page(s):2357 - 2363 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (533 KB) | HTML iconHTML

    This paper details the application of a multi-objective cooperative co-evolutionary on-line EA (MOC-COLEA) to the guidance of a swarm of multiple missiles, against multiple targets. The multi-objective algorithm is used to develop a dynamic objective front which is used to trade the spatial distribution of missiles at impact, against the time to impact. Each missile optimises its own performance, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A probabilistic analysis of in vitro selection of independent DNA words for computation

    Publication Year: 2004, Page(s):1882 - 1888 Vol.2
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (436 KB) | HTML iconHTML

    An important problem in DNA computing is cross-hybridization which, if it occurs between words, affects the reliability and efficiency of the computation. An in vitro selection protocol has been developed that selects maximally mismatched DNA sequences. The protocol is analyzed, and a probabilistic model of the protocol is developed. The analysis shows that the selection probability should obey a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GENACE: an efficient cultural algorithm for solving the flexible job-shop problem

    Publication Year: 2004, Page(s):1759 - 1766 Vol.2
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (520 KB) | HTML iconHTML

    This work presents an efficient methodology called GENACE for solving the flexible job-shop scheduling problem (or FJSP) with recirculation. We show how CDRs are used to solve the FJSP with recirculation by themselves and to provide a bootstrapping mechanism to initialize GENACE. We then adopt a cultural evolutionary architecture to maintain knowledge of schemata and resource allocations learned o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling coevolutionary genetic algorithms on two-bit landscapes: partnering strategies

    Publication Year: 2004, Page(s):2349 - 2356 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (586 KB) | HTML iconHTML

    Different from standard genetic algorithms where each individual is evaluated separately according to predefined objective function(s), one most notable characteristic of coevolutionary genetic algorithms (CGA) is that evaluation procedures require more than one individual and an individual's fitness is depending on its interactions with its partners. In consequence, the implemented partnering str... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multicriteria genetic algorithm to analyze microarray data

    Publication Year: 2004, Page(s):1874 - 1881 Vol.2
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (573 KB) | HTML iconHTML

    Knowledge discovery from DNA microarray data has become an important research area for biologists. Association rules is an important task of knowledge discovery that can be applied to the analysis of gene expression in order to identify patterns of genes and regulatory network. Association rules discovery may be modeled as an optimization problem. We propose a multicriteria model for association r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cultural algorithms: knowledge learning in dynamic environments

    Publication Year: 2004, Page(s):1751 - 1758 Vol.2
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (541 KB) | HTML iconHTML

    Our previous work on real-valued function optimization problems had shown that cultural learning emerged as the result of meta-level interaction or swarming of knowledge sources, "knowledge swarms" in the belief space. These meta-level swarms induced the swarming of individuals in the population space, "cultural swarms". The interaction of these knowledge sources with the population swarms produce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a bounded Pareto-coevolution archive

    Publication Year: 2004, Page(s):2341 - 2348 Vol.2
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (638 KB) | HTML iconHTML

    Convolution offers adaptive methods for the selection of tests used to evaluate individuals, but the resulting evaluation can be unstable. Recently, general archive-based coevolution methods have become available for which monotonic progress can be guaranteed. The size of these archives may grow indefinitely however, thus limiting their application potential. Here, we investigate how the size of a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coevolution and Tartarus

    Publication Year: 2004, Page(s):1618 - 1624 Vol.2
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (589 KB) | HTML iconHTML

    Coevolution is the process of mutual adaptation of two populations. When a difficult optimization is performed with evolutionary computation, a population of adaptive test cases can strongly affect the progress of evolution. This study applies coevolution to the Tartarus task, a grid robot test problem. If the coevolving test cases are viewed as a form of parasite, then the question of virulence b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CODEGEN: the generation and testing of DNA code words

    Publication Year: 2004, Page(s):1865 - 1873 Vol.2
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (691 KB) | HTML iconHTML

    With This work we present algorithms to generate and test DNA code words that avoid unwanted cross hybridizations. Methods from the theory of codes based on formal languages are employed. These algorithms are implemented in user-friendly software, CODEGEN, which contains a collection of language-theoretic objects adaptable to various related tasks. Lists of code words may be stored, viewed, altere... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of kinship cooperation learning strategy and culture on the resilience of social systems in the village multi-agent simulation

    Publication Year: 2004, Page(s):1743 - 1750 Vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (550 KB) | HTML iconHTML

    The multi-agent village simulation was initially developed to examine the settlement and farming practices of prehispanic Pueblo Indians of the Central Mesa Verde region of Southwest Colorado (Kohler, 2000; Kohler et al.). The original model of Kohler was used to examine whether drought alone was responsible for the departure of the prehispanic Puebloan people from the Four Corners region after 70... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On geometric and statistical properties of the attractors of a generic evolutionary algorithm

    Publication Year: 2004, Page(s):1240 - 1247 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (482 KB) | HTML iconHTML

    In this work, evolutionary algorithms are modeled as random dynamical systems. The combined action of selection and variation is expressed as a stochastic operator acting on the space of populations. The long term behavior of selection and variation is studied separately. Then the combined effect is analyzed by characterizing the attractor and stationary measure of the dynamics. As a main result i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hierarchical approach for adaptive humanoid robot control

    Publication Year: 2004, Page(s):1546 - 1553 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (681 KB) | HTML iconHTML

    We propose a hierarchical approach called "CBR augmented GP" to evolve robust control programs for humanoid robots. Humanoid robots are high-dimensional systems; thus it is very difficult for GP to generate control programs for humanoid robots. The key idea in our approach is to extract control rules with GP in simplified simulation and get a prototype of the control program then interpret and int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical surrogate-assisted evolutionary optimization framework

    Publication Year: 2004, Page(s):1586 - 1593 Vol.2
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (598 KB) | HTML iconHTML

    This work presents enhancements to a surrogate-assisted evolutionary optimization framework proposed earlier in the literature for solving computationally expensive design problems on a limited computational budget (Ong et al., 2003). The main idea of our former framework was to couple evolutionary algorithms with a feasible sequential quadratic programming solver in the spirit of Lamarckian learn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An evolutionary algorithm method for sampling n-partite graphs

    Publication Year: 2004, Page(s):2250 - 2257 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (497 KB) | HTML iconHTML

    The growth of use of graph-structured databases modeled on n-partite graphs has increased the ability to generate more flexible databases. However, the calculation of certain features in these databases may be highly resource-consuming. This work proposes a method for approximating these features by sampling. A discussion of the difficulty of sampling in n-partite graphs is made and an evolutionar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial recombination for the co-evolution of model parameters

    Publication Year: 2004, Page(s):2216 - 2223 Vol.2
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (540 KB) | HTML iconHTML

    Partial recombination is a type of crossover for genetic algorithms that focuses on a subset of the chromosome. It provides a means of doing crossover were only the genes involved in producing the fitness are affected. In this paper, we use it to evolve the parameters for a model that represents the capabilities of a robot. The values of these parameters are evolved as the robot periodically perfo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel memetic algorithm with random multi-local-search: a case study of TSP

    Publication Year: 2004, Page(s):2335 - 2340 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (452 KB) | HTML iconHTML

    Memetic algorithms (MAs) have been shown to be very effective in finding near optimal solutions to hard combinatorial optimization problems. We propose a novel memetic algorithm (MsMA), in which a new local search scheme is introduced. We called this local search scheme as random multi-local-search (MLS). The MLS is composed of several local search schemes, each of which executes with a predefined... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On designing CO$T: a new approach and programming environment for distributed problem solving based on evolutionary computation and anytime algorithms

    Publication Year: 2004, Page(s):1836 - 1843 Vol.2
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (686 KB) | HTML iconHTML

    In This work we present a unified view of AI inspired by ideas from evolutionary computation as design of bounded rational agents. The approach specifies optimal programs rather than optimal actions, and is based on process algebras and anytime algorithms. The search method described in This work is so general than many other search algorithms, including evolutionary search methods, become its spe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coevolutionary TEMPO game

    Publication Year: 2004, Page(s):1610 - 1617 Vol.2
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (550 KB) | HTML iconHTML

    We present a description and initial results of a computer code that coevolves fuzzy logic rules to play a two-sided zero-sum competitive game. It is based on the TEMPO military planning game that has been used to teach resource allocation to over 20,000 students over the past 40 years. No feasible algorithm for optimal play is known. The coevolved rules, when pitted against human players, usually... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation of floral specialization in bees

    Publication Year: 2004, Page(s):1859 - 1864 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (446 KB) | HTML iconHTML

    In this study the nectar-gathering behavior of population of virtual bees is observed during visits to a field of simulated flowers over several hundred generations. The object of the study is to see if floral constancy evolves in the virtual bees. Floral constancy, observed in real bees, is the tendency to harvest nectar from only one type of flower. Flowers can only reproduce if they have receiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subspace FDC for sharing distance estimation

    Publication Year: 2004, Page(s):1735 - 1742 Vol.2
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (517 KB) | HTML iconHTML

    Niching techniques diversify the population of evolutionary algorithms, encouraging heterogeneous convergence to multiple optima. The key to an effective diversification is identifying the similarity among individuals. With no prior knowledge of the fitness landscapes, it is usually determined by uninformative assumptions on the number of peaks. We propose a method to estimate the sharing distance... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.