By Topic

IEEE Transactions on Evolutionary Computation

Issue 3 • Date June 2016

Filter Results

Displaying Results 1 - 20 of 20
  • Table of contents

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

    Publication Year: 2016, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • A Modified Ant Colony Optimization Algorithm for Network Coding Resource Minimization

    Publication Year: 2016, Page(s):325 - 342
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2629 KB) | HTML iconHTML

    This paper presents a modified ant colony optimization (ACO) approach for the network coding resource minimization problem. It is featured with several attractive mechanisms specially devised for solving the concerned problem: 1) a multidimensional pheromone maintenance mechanism is put forward to address the issue of pheromone overlapping; 2) problem-specific heuristic information is employed to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multifactorial Evolution: Toward Evolutionary Multitasking

    Publication Year: 2016, Page(s):343 - 357
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1984 KB) | HTML iconHTML

    The design of evolutionary algorithms has typically been focused on efficiently solving a single optimization problem at a time. Despite the implicit parallelism of population-based search, no attempt has yet been made to multitask, i.e., to solve multiple optimization problems simultaneously using a single population of evolving individuals. Accordingly, this paper introduces evolutionary multita... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Unified Evolutionary Optimization Procedure for Single, Multiple, and Many Objectives

    Publication Year: 2016, Page(s):358 - 369
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1228 KB) | HTML iconHTML Multimedia Media

    Traditionally, evolutionary algorithms (EAs) have been systematically developed to solve mono-, multi-, and many-objective optimization problems, in this order. Despite some efforts in unifying different types of mono-objective evolutionary and non-EAs, researchers are not interested enough in unifying all three types of optimization problems together. Such a unified algorithm will allow users to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of Stability, Local Convergence, and Transformation Sensitivity of a Variant of the Particle Swarm Optimization Algorithm

    Publication Year: 2016, Page(s):370 - 385
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1834 KB) | HTML iconHTML

    In this paper, we investigate three important properties (stability, local convergence, and transformation invariance) of a variant of particle swarm optimization (PSO) called standard PSO 2011 (SPSO2011). Through some experiments, we identify boundaries of coefficients for this algorithm that ensure particles converge to their equilibrium. Our experiments show that these convergence boundaries fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualization and Performance Metric in Many-Objective Optimization

    Publication Year: 2016, Page(s):386 - 402
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3692 KB) | HTML iconHTML

    Visualization of population in a high-dimensional objective space throughout the evolution process presents an attractive feature that could be well exploited in designing many-objective evolutionary algorithms (MaOEAs). In this paper, a new visualization method is proposed. It maps individuals from a high-dimensional objective space into a 2-D polar coordinate plot while preserving Pareto dominan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic Component-Wise Design of Multiobjective Evolutionary Algorithms

    Publication Year: 2016, Page(s):403 - 417
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1822 KB) | HTML iconHTML Multimedia Media

    Multiobjective evolutionary algorithms (MOEAs) are typically proposed, studied, and applied as monolithic blocks with a few numerical parameters that need to be set. Few works have studied how the algorithmic components of these evolutionary algorithms can be classified and combined to produce new algorithmic designs. The motivation for studies of this latter type stem from the development of flex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Sparse Spectral Clustering Framework via Multiobjective Evolutionary Algorithm

    Publication Year: 2016, Page(s):418 - 433
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2091 KB) | HTML iconHTML Multimedia Media

    This paper introduces sparse representation into spectral clustering and provides a sparse spectral clustering framework via a multiobjective evolutionary algorithm. In contrast to conventional spectral clustering, the main contribution of this paper is to construct the similarity matrix using a sparse representation approach by modeling spectral clustering as a constrained multiobjective optimiza... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Permutation in a Haystack Problem and the Calculus of Search Landscapes

    Publication Year: 2016, Page(s):434 - 446
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1528 KB) | HTML iconHTML

    The natural encoding for many search and optimization problems is the permutation, such as the traveling salesperson, vehicle routing, scheduling, assignment and mapping problems, among others. The effectiveness of a given mutation or crossover operator depends upon the nature of what the permutation represents. For some problems, it is the absolute locations of the elements that most directly inf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint Consensus Mutation-Based Differential Evolution for Constrained Optimization

    Publication Year: 2016, Page(s):447 - 459
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2052 KB) | HTML iconHTML Multimedia Media

    Until now, numerous mutation strategies have been introduced as search operators within the differential evolution (DE) algorithm. These operators are designed mainly to improve fitness value while also maintaining diversity in the population, but they do not directly act to reduce constraint violations of constrained problems. Interestingly, the so-called constraint handling techniques, used with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing Nash Equilibria and Evolutionarily Stable States of Evolutionary Games

    Publication Year: 2016, Page(s):460 - 469
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1060 KB) | HTML iconHTML

    Stability analysis is an important research direction in evolutionary game theory. Evolutionarily stable states have a close relationship with Nash equilibria of repeated games, which are characterized by the folk theorem. When applying the folk theorem, one needs to compute the minimax profile of the game in order to find Nash equilibria. Computing the minimax profile is an NP-hard problem. In th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The N -Player Trust Game and its Replicator Dynamics

    Publication Year: 2016, Page(s):470 - 474
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (543 KB) | HTML iconHTML

    Trust is a fundamental concept that underpins the coherence and resilience of social systems and shapes human behavior. Despite the importance of trust as a social and psychological concept, the concept has not gained much attention from evolutionary game theorists. In this letter, an N-player trust-based social dilemma game is introduced. While the theory shows that a society with no untrustworth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constrained Subproblems in a Decomposition-Based Multiobjective Evolutionary Algorithm

    Publication Year: 2016, Page(s):475 - 480
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB) | HTML iconHTML

    A decomposition approach decomposes a multiobjective optimization problem into a number of scalar objective optimization subproblems. It plays a key role in decomposition-based multiobjective evolutionary algorithms. However, many widely used decomposition approaches, originally proposed for mathematical programming algorithms, may not be very suitable for evolutionary algorithms. To help decompos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE World Congress on Computational Intelligence

    Publication Year: 2016, Page(s): 481
    Request permission for commercial reuse | PDF file iconPDF (765 KB)
    Freely Available from IEEE
  • 2016 IEEE Symposium Series on Computational Intelligence

    Publication Year: 2016, Page(s): 482
    Request permission for commercial reuse | PDF file iconPDF (1098 KB)
    Freely Available from IEEE
  • Introducing IEEE Collabratec

    Publication Year: 2016, Page(s): 483
    Request permission for commercial reuse | PDF file iconPDF (2183 KB)
    Freely Available from IEEE
  • Member Get-A-Member (MGM) Program

    Publication Year: 2016, Page(s): 484
    Request permission for commercial reuse | PDF file iconPDF (3380 KB)
    Freely Available from IEEE
  • IEEE Transactions on Evolutionary Computation Society Information

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

    Publication Year: 2016, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (66 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