By Topic

IEEE Transactions on Evolutionary Computation

Issue 3 • Date June 2012

Filter Results

Displaying Results 1 - 15 of 15
  • Table of contents

    Publication Year: 2012, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • IEEE Transactions on Evolutionary Computation publication information

    Publication Year: 2012, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (38 KB)
    Freely Available from IEEE
  • A Cluster and Gradient-Based Artificial Immune System Applied in Optimization Scenarios

    Publication Year: 2012, Page(s):301 - 318
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (22883 KB) | HTML iconHTML

    The main objective of this paper is to use artificial immune systems (AIS) in optimization problems. For this purpose, two major immunological principles presented in the literature are revisited: hypermutation, which is responsible for local search, and receptor edition, used to explore different areas in the solution space. This paper presents three major modifications divided into two different... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum Satisfiability: Anatomy of the Fitness Landscape for a Hard Combinatorial Optimization Problem

    Publication Year: 2012, Page(s):319 - 338
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (13928 KB) | HTML iconHTML

    The fitness landscape of MAX-3-SAT is investigated for random instances above the satisfiability phase transition. This paper includes a scaling analysis of the time to reach a local optimum, the number of local optima, the expected probability of reaching a local optimum as a function of its fitness, the expected fitness found by local search and the best fitness, the probability of reaching a gl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-Coded Chemical Reaction Optimization

    Publication Year: 2012, Page(s):339 - 353
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6643 KB) | HTML iconHTML

    Optimization problems can generally be classified as continuous and discrete, based on the nature of the solution space. A recently developed chemical-reaction-inspired metaheuristic, called chemical reaction optimization (CRO), has been shown to perform well in many optimization problems in the discrete domain. This paper is dedicated to proposing a real-coded version of CRO, namely, RCCRO, to so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Study of Collapse in Bare Bones Particle Swarm Optimization

    Publication Year: 2012, Page(s):354 - 372
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2350 KB) | HTML iconHTML

    The dynamic update rule of particle swarm optimization is formulated as a second-order stochastic difference equation and general relations are derived for search focus, search spread, and swarm stability at stagnation. The relations are applied to three particular particle swarm optimization (PSO) implementations, the standard PSO of Clerc and Kennedy, a PSO with discrete recombination, and the B... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiobjectivization via Helper-Objectives With the Tunable Objectives Problem

    Publication Year: 2012, Page(s):373 - 390
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3047 KB) | HTML iconHTML

    Multiobjectivization, the optimization of a single-objective problem by adding objectives, has recently received interest by researchers. Studying multiobjectivization on an abstract problem can assist in understanding the fundamental drivers of the improvements in performance that multiobjectivization achieves in some situations. Previously created abstract problems do not appear to provide the m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolutionary Design of Both Topologies and Parameters of a Hybrid Dynamical System

    Publication Year: 2012, Page(s):391 - 405
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (9842 KB) | HTML iconHTML

    This paper investigates the issue of evolutionary design of open-ended plants for hybrid dynamical systems, i.e., both their topologies and parameters. Hybrid bond graphs (HBGs) are used to represent dynamical systems involving both continuous and discrete system dynamics. Genetic programming, with some special mechanisms incorporated, is used as a search tool to explore the open-ended design spac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Grammatical Evolution of Local Search Heuristics

    Publication Year: 2012, Page(s):406 - 417
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1731 KB) | HTML iconHTML

    Genetic programming approaches have been employed in the literature to automatically design constructive heuristics for cutting and packing problems. These heuristics obtain results superior to human-created constructive heuristics, but they do not generally obtain results of the same quality as local search heuristics, which start from an initial solution and iteratively improve it. If local sear... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Multiobjective Genetic Algorithm to Find Communities in Complex Networks

    Publication Year: 2012, Page(s):418 - 430
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7805 KB) | HTML iconHTML

    A multiobjective genetic algorithm to uncover community structure in complex network is proposed. The algorithm optimizes two objective functions able to identify densely connected groups of nodes having sparse inter-connections. The method generates a set of network divisions at different hierarchical levels in which solutions at deeper levels, consisting of a higher number of modules, are contai... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Genetic Approach to Statistical Disclosure Control

    Publication Year: 2012, Page(s):431 - 441
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1124 KB) | HTML iconHTML

    Statistical disclosure control is the collective name for a range of tools used by data providers such as government departments to protect the confidentiality of individuals or organizations. When the published tables contain magnitude data such as turnover or health statistics, the preferred method is to suppress the values of certain cells. Assigning a cost to the information lost by suppressin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decomposition-Based Multiobjective Evolutionary Algorithm With an Ensemble of Neighborhood Sizes

    Publication Year: 2012, Page(s):442 - 446
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3893 KB) | HTML iconHTML

    The multiobjective evolutionary algorithm based on decomposition (MOEA/D) has demonstrated superior performance by winning the multiobjective optimization algorithm competition at the CEC 2009. For effective performance of MOEA/D, neighborhood size (NS) parameter has to be tuned. In this letter, an ensemble of different NSs with online self-adaptation is proposed (ENS-MOEA/D) to overcome this shor... View full abstract»

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

    Publication Year: 2012, Page(s):447 - 448
    Request permission for commercial reuse | PDF file iconPDF (1564 KB)
    Freely Available from IEEE
  • IEEE Computational Intelligence Society Information

    Publication Year: 2012, Page(s): C3
    Request permission for commercial reuse | PDF file iconPDF (38 KB)
    Freely Available from IEEE
  • IEEE Transactions on Evolutionary Computation information for authors

    Publication Year: 2012, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (31 KB)
    Freely Available from IEEE

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