By Topic

IEEE Transactions on Evolutionary Computation

Issue 4 • Aug. 2001

Filter Results

Displaying Results 1 - 12 of 12
  • Evolutionary robotics: the biology, intelligence, and technology of self-organizing machines [Book Review]

    Publication Year: 2001, Page(s):429 - 430
    Request permission for commercial reuse | PDF file iconPDF (14 KB) | HTML iconHTML
    Freely Available from IEEE
  • Self-adaptive mutations may lead to premature convergence

    Publication Year: 2001, Page(s):410 - 414
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    Self-adaptive mutations are known to endow evolutionary algorithms (EA) with the ability of locating local optima quickly and accurately, whereas it was unknown whether these local optima are finally global optima provided that the EA runs long enough. In order to answer this question, it is assumed that the (1+1)-EA with self-adaptation is located in the vicinity P of a local solution with object... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamics of infinite populations evolving in a landscape of uni and bimodal fitness functions

    Publication Year: 2001, Page(s):398 - 409
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB) | HTML iconHTML

    It is known that the distribution of a population evolving in a landscape of a single adaptive hill is unimodal and centered at the optimum. Evolution of a population in a landscape of two adaptive hills is a more interesting example with consequences to theoretical interpretations and applications in optimization. Its formal analysis is not a trivial task. This paper considers theoretical aspects... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolutionary pattern search algorithms for unconstrained and linearly constrained optimization

    Publication Year: 2001, Page(s):388 - 397
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB) | HTML iconHTML

    We describe a convergence theory for evolutionary pattern search algorithms (EPSA) on a broad class of unconstrained and linearly constrained problems. EPSA adaptively modify the step size of the mutation operator in response to the success of previous optimization steps. The design of EPSA is inspired by recent analyzes of pattern search methods. Our analysis significantly extends the previous co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel hybrid method for SAT that couples genetic algorithms and local search

    Publication Year: 2001, Page(s):323 - 334
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    A parallel hybrid method for solving the satisfiability (SAT) problem that combines cellular genetic algorithms (GAs) and the random walk SAT (WSAT) strategy of greedy SAT (GSAT) is presented. The method, called cellular genetic WSAT (CGWSAT), uses a cellular GA to perform a global search from a random initial population of candidate solutions and a local selective generation of new strings. The g... View full abstract»

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

    Publication Year: 2001, Page(s):349 - 358
    Cited by:  Papers (164)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB) | HTML iconHTML

    We present grammatical evolution, an evolutionary algorithm that can evolve complete programs in an arbitrary language using a variable-length binary string. The binary genome determines which production rules in a Backus-Naur form grammar definition are used in a genotype-to-phenotype mapping process to a program. We demonstrate how expressions and programs of arbitrary complexity may be evolved ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling crossover-induced linkage in genetic algorithms

    Publication Year: 2001, Page(s):376 - 387
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    The dynamics of a genetic algorithm undergoing ranking selection, mutation, and two-point crossover for the ones-counting problem is studied using a statistical mechanics approach. This approach has been used previously to study this problem, but with uniform crossover. Two-point crossover induces additional linkage between nearby loci, which changes the dynamics significantly. To account for this... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying an evolutionary algorithm to telecommunication network design

    Publication Year: 2001, Page(s):309 - 322
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    This paper deals with the application of evolutionary computation to telecommunication network design. Design of a two-layer network is considered, where the upper-layer (UL) network uses resources of the lower-layer (LL) network. UL links determine demands for the LL and are implemented using LL paths (admissible paths). Within a fixed LL network topology, given the demands and admissible paths, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parameter optimization of an on-chip voltage reference circuit using evolutionary programming

    Publication Year: 2001, Page(s):414 - 421
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    This paper presents an application of evolutionary programming to parameter optimization in the design of a voltage reference circuit. Designing circuits consists of two steps: topological design and parameter determination. After designing a topology suitable for the circuit, the designer selects an appropriate value for each circuit element from a circuit analysis and his experience. This step i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GAVEL - a new tool for genetic algorithm visualization

    Publication Year: 2001, Page(s):335 - 348
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB) | HTML iconHTML

    This paper surveys the state of the art in evolutionary algorithm visualization and describes a new tool called GAVEL. It provides a means to examine in a genetic algorithm (GA) how crossover and mutation operations assembled the final result, where each of the alleles came from, and a way to trace the history of user-selected sets of alleles. A visualization tool of this kind can be very useful i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regularization approach to inductive genetic programming

    Publication Year: 2001, Page(s):359 - 375
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    This paper presents an approach to regularization of inductive genetic programming tuned for learning polynomials. The objective is to achieve optimal evolutionary performance when searching high-order multivariate polynomials represented as tree structures. We show how to improve the genetic programming of polynomials by balancing its statistical bias with its variance. Bias reduction is achieved... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolving an expert checkers playing program without using human expertise

    Publication Year: 2001, Page(s):422 - 428
    Cited by:  Papers (88)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB) | HTML iconHTML

    An evolutionary algorithm has taught itself how to play the game of checkers without using features that would normally require human expertise. Using only the raw positions of pieces on the board and the piece differential, the evolutionary program optimized artificial neural networks to evaluate alternative positions in the game. Over the course of several hundred generations, the program taught... View full abstract»

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

Aims & Scope

IEEE Transactions on Evolutionary Computation publishes archival quality original papers in evolutionary computation and related areas including nature-inspired algorithms, population-based methods, and optimization where selection and variation are integral, and hybrid systems where these paradigms are combined. Purely theoretical papers are considered as are application papers that provide general insights into these areas of computation.
 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief

Dr. Kay Chen Tan (IEEE Fellow)

Department of Electrical and Computer Engineering

National University of Singapore

Singapore 117583

Email: eletankc@nus.edu.sg

Website: http://vlab.ee.nus.edu.sg/~kctan