Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)

16-19 July 2000

Go

Filter Results

Displaying Results 1 - 25 of 104
  • Proceedings of the 2000 Congress on Evolutionary Computation

    Publication Year: 2000, Page(s):0_2 - xxvi
    Request permission for commercial reuse | PDF file iconPDF (1057 KB)
    Freely Available from IEEE
  • Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering

    Publication Year: 2000
    Request permission for commercial reuse | PDF file iconPDF (679 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2000, Page(s):1585 - 1590
    Request permission for commercial reuse | PDF file iconPDF (337 KB)
    Freely Available from IEEE
  • Parallel genetic algorithms with a continuity operator that allows for knowledge inclusion

    Publication Year: 2000, Page(s):1137 - 1143 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    In recent years we introduced a continuity operator, the “Superindividual”, that allows for the inclusion of knowledge in the evolution of the genetic algorithm. Since we deal with very complex optimization problems, we developed a parallel genetic algorithm, with the Superindividual operator. The paper presents this parallel algorithm, which improves on the results of the conventional... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic distributed genetic algorithms

    Publication Year: 2000, Page(s):1132 - 1136 vol.2
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    Distributed populations in genetic algorithms can make the search more smart, in that local minima may be skipped. However, when the global population is divided into small sub-populations, the ability of these sub-populations to evolve is set back because of their relatively small sizes. In this paper, a new method to manage the distributed populations in evolution is introduced. A supervising su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic rotation and partial visibility

    Publication Year: 2000, Page(s):1125 - 1131 vol.2
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    This article generalizes a previously presented dynamic fitness function with two different concepts, namely a coordinate rotation and the concept of partial visibility. Those concepts define different classes of test problems. A set of standard evolution strategies and genetic algorithms with and without hypermutation are tested on two of the dynamic problem classes. They give insight into certai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence properties of some multi-objective evolutionary algorithms

    Publication Year: 2000, Page(s):1010 - 1016 vol.2
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    We present four abstract evolutionary algorithms for multi-objective optimization and theoretical results that characterize their convergence behavior. Thanks to these results it is easy to verify whether or not a particular instantiation of these abstract evolutionary algorithms offers the desired limit behavior. Several examples are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effects of hierarchical migration in a parallel distributed parameter-free GA

    Publication Year: 2000, Page(s):1117 - 1124 vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    Effects of hierarchical migration methods in a parallel distributed Parameter-free GA (PfGA) are described. The PfGA is a compact and robust algorithm that extracts a local population from the whole population and evolves it by adaptively changing the size of the subpopulation. We propose hierarchically parallel distributed architectures with migration methods for the PfGA implementing them in a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A replicator equations-based evolutionary algorithm for the maximum clique problem

    Publication Year: 2000, Page(s):1565 - 1570 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    The author proposes a heuristic based evolutionary algorithm for the maximum clique problem. The algorithm is based on a local search heuristic centered on a continuous formulation of the problem which is approached with a class of dynamical systems called replicator equations. We show how, embedding this local search heuristic within an evolutionary algorithm, helps the replicator equation heuris... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamics of a distance-based population diversity measure

    Publication Year: 2000, Page(s):1002 - 1009 vol.2
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    We study a class of steady-state genetic algorithms where, at each time step, two parents are selected to produce a child which then replaces one member of the population at the next time step. We consider the finite-population case. A general crossover and mutation operation are defined, as well as a genomic distance between individuals. Certain specific properties are required to hold for such o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying Fuzzy CoCo to breast cancer diagnosis

    Publication Year: 2000, Page(s):1168 - 1175 vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Coevolutionary algorithms have received increased attention in the past few years within the domain of evolutionary computation. We combine the search power of coevolutionary computation with the expressive power of fuzzy systems, introducing a novel algorithm, Fuzzy CoCo: Fuzzy Cooperative Coevolution. We demonstrate the efficacy of Fuzzy CoCo by applying it to a hard, real-world problem-breast c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation, mutation and crossover issues in evolutionary computation

    Publication Year: 2000, Page(s):916 - 923 vol.2
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    Representation, and the use of mutation and crossover or recombination are issues which some people from the different areas within evolutionary computation still disagree. The philosophical and representational differences we can attribute to the initial applications of each of the areas. We examine the role of mutation and crossover/recombination and when we mould expect them to work successfull... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolutionary neural networks for time series prediction based on L-system and DNA coding method

    Publication Year: 2000, Page(s):1467 - 1474 vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    The authors propose a method of constructing neural networks using bio-inspired emergent and evolutionary concepts. This method is an algorithm that is based on the characteristics of biological DNA and the growth of plants. The authors propose a construction method to make a DNA coding method for production rule of L-system. The L-system is based on the so-called parallel rewriting mechanism. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Misleading functions designed from alternation

    Publication Year: 2000, Page(s):1056 - 1063 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    The paper proposes the design of difficult functions for a GA (genetic algorithm) where the deceptive attractor is at mid-distance from the global optimum. First, piecewise-linear trap functions of alternation are investigated. We consider alternation based distance to enable the ability of fitness distance correlation coefficient to predict GA behavior on such functions. Then, we generalize to an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Training neurocontrollers by local and evolutionary search

    Publication Year: 2000, Page(s):1558 - 1564 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    Training of neural networks by local search such as gradient based algorithms could be difficult. This calls for the development of alternative training algorithms such as evolutionary search. However, training by evolutionary search often requires long computation time. The authors investigate the possibilities of reducing the time taken by combining the efforts of local search and evolutionary s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analog circuit design with a variable length chromosome

    Publication Year: 2000, Page(s):994 - 1001 vol.2
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    This paper proposes a system of evolving analog circuits based on a variable length chromosome. Methods featured are the chromosome of a component list, the multi-stage evolution, and the pressure on the circuit size. A set of experiments are described to confirm the system's robustness, the scalability of a circuit, and the efficiency of time and the memory consumption. The first experiment shows... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A GA perspective of the energy requirements for manipulators maneuvering in a workspace with obstacles

    Publication Year: 2000, Page(s):1110 - 1116 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    This paper proposes a genetic algorithm to generate trajectories for robotic manipulators. The objective is to minimize the ripple in the trajectory time evolution and to minimize the actuator energy requirements without colliding with any obstacles in the workspace. The article presents the results for several redundant and hyper-redundant manipulators View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterated function system fractals for the detection and display of DNA reading frame

    Publication Year: 2000, Page(s):1160 - 1167 vol.2
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    We report a technique for using an evolutionary algorithm to select the parameters for a data-driven iterated function system. Such iterated function systems are typically driven with uniform random numbers to produce fractals. We instead drive the iterated function system with a biased source mimicking DNA with and without stop codons. An evolutionary algorithm is used to produce fractals that vi... View full abstract»

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

    Publication Year: 2000, Page(s):1025 - 1032 vol.2
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    With the emergence of standardized problem generators for dynamic problem environments, we are just starting to systematically measure the performance of different evolutionary-algorithm (EA) extensions against standard classes of problems. We revisit triggered hypermutation, one of the early and most successful implementations of EA's for dynamic environments. Using an implementation of this algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new fitness function for discovering a lot of satisfiable solutions in constraint satisfaction problems

    Publication Year: 2000, Page(s):1184 - 1189 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    In this paper, we discuss how many satisfiable solutions a genetic algorithm can find in a problem instance of a constraint satisfaction problems in a single execution. Hence, we propose a framework for a new fitness function which can be applied to traditional fitness functions. However, the mechanism of the proposed fitness function is quite simple, and several experimental results on a variety ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework of fuzzy modeling using genetic algorithms with appropriate combination of evaluation criteria

    Publication Year: 2000, Page(s):1252 - 1259 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (444 KB)

    Fuzzy modeling is a method to describe nonlinear input-output relationships. Genetic algorithms (GAs) have been used with fuzzy modeling for identification of the structure of a fuzzy model and selection of input variables. Users often require fuzzy models that satisfy multiple evaluation criteria. Assignment of appropriate weights on these criteria is one of the key factors for good GA search. In... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Benefits of clustering among the Internet search agents caught in the n-person prisoner's dilemma game

    Publication Year: 2000, Page(s):864 - 871 vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    In searching for information on the Internet, often times one experiences contention of information servers. Usually, information on the Internet is collected by autonomous search agents that send out queries to the servers that may have the information sought. From a single agent's perspective, sending out as many queries as possible maximizes the chance of achieving the information sought. Howev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolving pet robot with emotional model

    Publication Year: 2000, Page(s):1231 - 1237 vol.2
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    Deals with a pet robot with an emotional model. The robot requires several capabilities, such as perceiving, acting, communicating and surviving. Furthermore, it should learn various behaviors through interaction with its owner. This paper focuses on teaching a pet robot tricks or to dance. Basically, the owner can teach these tricks by simple communication based on trial and error. The robot perf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A genetic algorithm for the orienteering problem

    Publication Year: 2000, Page(s):910 - 915 vol.2
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    This paper presents a genetic algorithm to solve the orienteering problem, which is concerned with finding a path between a given set of control points, among which a start and an end point are specified, so as to maximize the total score collected subject to a prescribed time constraint. Employing three sets of test problems from the literature, the performance of the genetic algorithm is evaluat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to evolve a Napoleon complex

    Publication Year: 2000, Page(s):851 - 856 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    In some species of animals, fights for scarce resources tend to be initiated by the smaller contestant, who is also more likely to eventually lose the fight. An evolutionary algorithm is used to study under which conditions such a behavior would evolve. The simulations partially confirm predictions of an earlier mathematical model, but also show an unexpectedly complex evolutionary dynamic of the ... View full abstract»

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