Scheduled System Maintenance
On Saturday, December 10, single article sales and account management will be unavailable from 5:00 AM-7:30 PM ET.
We apologize for the inconvenience.
By Topic

IEEE Transactions on Evolutionary Computation

Issue 1 • Feb. 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 (35 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
  • Robustness Against the Decision-Maker's Attitude to Risk in Problems With Conflicting Objectives

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

    In multiobjective optimization problems (MOPs), the Pareto set consists of efficient solutions that represent the best trade-offs between the conflicting objectives. Many forms of uncertainty affect the MOP, including uncertainty in the decision variables, parameters or objectives. A source of uncertainty that is not studied in the evolutionary multiobjective optimization (EMO) literature is the d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Preference-Based Solution Selection Algorithm for Evolutionary Multiobjective Optimization

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

    Since multiobjective evolutionary algorithms (MOEAs) provide a set of nondominated solutions, decision making of selecting a preferred one out of them is required in real applications. However, there has been some research on MOEA in which the user's preferences are incorporated for this purpose. This paper proposes preference-based solution selection algorithm (PSSA) by which user can select a pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Immune Clonal Algorithm for MO Problems

    Publication Year: 2012, Page(s):35 - 50
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (13406 KB) | HTML iconHTML

    Research on multiobjective optimization (MO) becomes one of the hot points of intelligent computation. Compared with evolutionary algorithm, the artificial immune system used for solving MO problems (MOPs) has shown many good performances in improving the convergence speed and maintaining the diversity of the antibody population. However, the simple clonal selection computation has some difficulti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Gradients and Hybrid Evolutionary Algorithms for Real-Valued Multiobjective Optimization

    Publication Year: 2012, Page(s):51 - 69
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (8525 KB) | HTML iconHTML

    Algorithms that make use of the gradient, i.e., the direction of maximum improvement, to search for the optimum of a single-objective function have been around for decades. They are commonly accepted to be important and have been applied to tackle single-objective optimization problems in many fields. For multiobjective optimization problems, much less is known about the gradient and its algorithm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving Generalization Performance in Co-Evolutionary Learning

    Publication Year: 2012, Page(s):70 - 85
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4252 KB) | HTML iconHTML

    Recently, the generalization framework in co-evolutionary learning has been theoretically formulated and demonstrated in the context of game-playing. Generalization performance of a strategy (solution) is estimated using a collection of random test strategies (test cases) by taking the average game outcomes, with confidence bounds provided by Chebyshev's theorem. Chebyshev's bounds have the advant... View full abstract»

    Open Access
  • A Fast Way of Calculating Exact Hypervolumes

    Publication Year: 2012, Page(s):86 - 95
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7460 KB) | HTML iconHTML

    We describe a new algorithm WFG for calculating hypervolume exactly. WFG is based on the recently-described observation that the exclusive hypervolume of a point p relative to a set S is equal to the difference between the inclusive hypervolume of p and the hypervolume of S with each point limited by the objective values in p. WFG applies this technique iterative... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Rule-Based Evolutionary Approach to Music Performance Modeling

    Publication Year: 2012, Page(s):96 - 107
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4410 KB) | HTML iconHTML

    We describe an evolutionary approach to one of the most challenging problems in computer music: modeling how skilled musicians manipulate sound properties such as timing and amplitude in order to express their view of the emotional content of musical pieces. Starting with a collection of audio recordings of real performances, we apply a sequential-covering genetic algorithm in order to obtain comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge Orientation and the Design of Problem-Specific Crossover Operators for the OCST Problem

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

    In the Euclidean optimal communication spanning tree problem, the edges in optimal trees not only have small weights but also point with high probability toward the center of the graph. These characteristics of optimal solutions can be used for the design of problem-specific evolutionary algorithms (EAs). Recombination operators of direct encodings like edge-set and NetDir can be extended such tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining Multiobjective Optimization With Differential Evolution to Solve Constrained Optimization Problems

    Publication Year: 2012, Page(s):117 - 134
    Cited by:  Papers (75)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4766 KB) | HTML iconHTML

    During the past decade, solving constrained optimization problems with evolutionary algorithms has received considerable attention among researchers and practitioners. Cai and Wang's method (abbreviated as CW method) is a recent constrained optimization evolutionary algorithm proposed by the authors. However, its main shortcoming is that a trial-and-error process has to be used to choose suitable ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Evaluation of Evolutionary Algorithms for Optimal Filter Design

    Publication Year: 2012, Page(s):135 - 147
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (9813 KB) | HTML iconHTML

    In analog filter design, component values are selected due to manufactured constant values where performing an exhaustive search on all possible combinations of preferred values for obtaining an optimized design is not feasible. The application of evolutionary algorithms (EA) in analog active filter circuit design and optimization is a promising area which is based on concepts of natural selection... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2012 IEEE world congress on computational intelligence

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

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