By Topic

Evolutionary Computation, IEEE Transactions on

Issue 4 • Date Aug. 2003

Filter Results

Displaying Results 1 - 6 of 6
  • Directed variation in evolution strategies

    Page(s): 356 - 366
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (632 KB) |  | HTML iconHTML  

    Biological evolution gives rise to self-organizing phenomena. Inspired by this theory, directed variation is added to the (μ, λ) evolution strategies (ES) algorithm and it is called directed variation ES (DVES). In DVES, some neighboring individuals in the population mutate correlatively according to the distribution of the whole population. Experimental results showed that, with the same number of function evaluations, directed variation ES reached better optimization results for different generally used strategies under the ES framework. Experimental analysis showed that the application of directed variation could increase the expected fitness improvement and the probability of fitness improvement. From a biological perspective, directed variation can be regarded as a result of self-organizing evolution. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SOGARG: A self-organized genetic algorithm-based rule generation scheme for fuzzy controllers

    Page(s): 397 - 415
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1240 KB) |  | HTML iconHTML  

    This paper presents a self-organized genetic algorithm-based rule generation (SOGARG) method for fuzzy logic controllers. It is a three-stage hierarchical scheme that does not require any expert knowledge and input-output data. The first stage selects rules required to control the system in the vicinity of the set point. The second stage extends this to the entire input space, giving a rulebase that can bring the system to its set point from almost all initial states. The third stage refines the rulebase and reduces the number of rules. The first two stages use the same fitness function whose aim is only to acquire the controllability, but the last stage uses a different one, which attempts to optimize both the settling time and number of rules. The effectiveness of SOGARG is demonstrated using an inverted pendulum and the truck reversing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Society and civilization: An optimization algorithm based on the simulation of social behavior

    Page(s): 386 - 396
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (813 KB) |  | HTML iconHTML  

    The ability to mutually interact is a fundamental social behavior in all human and insect societies. Social interactions enable individuals to adapt and improve faster than biological evolution based on genetic inheritance alone. This is the driving concept behind the optimization algorithm introduced in this paper that makes use of the intra and intersociety interactions within a formal society and the civilization model to solve single objective constrained optimization problems. A society corresponds to a cluster of points in the parametric space while a civilization is a set of all such societies. Every society has its set of better performing individuals (leaders) that help others to improve through information exchange. This results in the migration of a point toward a better performing point, analogous to an intensified local search. Leaders improve only through an intersociety information exchange that results in the migration of a leader from a society to another. This helps the better performing societies to expand and flourish. View full abstract»

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

    Page(s): 344 - 355
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1546 KB) |  | HTML iconHTML  

    A new chromosome encoding method, named fuzzy coding, is proposed for representing real number parameters in a genetic algorithm. Fuzzy coding provides the value of a parameter on the basis of the optimum number of selected fuzzy sets and their effectiveness in terms of degree of membership. Thus, it represents the knowledge associated with each parameter and is an indirect method of encoding compared with alternatives, where the parameters are directly represented in the encoding. Fuzzy coding is described and compared with conventional binary coding, gray coding, and floating-point coding. Two test examples, along with neural identification of a nonlinear pH process from experimental data, are studied. It is shown that fuzzy coding is better than the conventional methods and is effective for parameter optimization in problems where the search space is complicated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Elitism-based compact genetic algorithms

    Page(s): 367 - 385
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1156 KB) |  | HTML iconHTML  

    This paper describes two elitism-based compact genetic algorithms (cGAs)-persistent elitist compact genetic algorithm (pe-cGA), and nonpersistent elitist compact genetic algorithm (ne-cGA). The aim is to design efficient cGAs by treating them as estimation of distribution algorithms (EDAs) for solving difficult optimization problems without compromising on memory and computation costs. The idea is to deal with issues connected with lack of memory by allowing a selection pressure that is high enough to offset the disruptive effect of uniform crossover. The pe-cGA finds a near optimal solution (i.e., a winner) that is maintained as long as other solutions generated from probability vectors are no better. The ne-cGA further improves the performance of the pe-cGA by avoiding strong elitism that may lead to premature convergence. It also maintains genetic diversity. This paper also proposes an analytic model for investigating convergence enhancement. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rank-density-based multiobjective genetic algorithm and benchmark test function study

    Page(s): 325 - 343
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1109 KB) |  | HTML iconHTML  

    Concerns the use of evolutionary algorithms (EA) in solving multiobjective optimization problems (MOP). We propose the use of a rank-density-based genetic algorithm (RDGA) that synergistically integrates selected features from existing algorithms in a unique way. A new ranking method, automatic accumulated ranking strategy, and a "forbidden region" concept are introduced, completed by a revised adaptive cell density evaluation scheme and a rank-density-based fitness assignment technique. In addition, four types of MOP features, such as discontinuous and concave Pareto front, local optimality, high-dimensional decision space and high-dimensional objective space are exploited and the corresponding MOP test functions are designed. By examining the selected performance indicators, RDGA is found to be statistically competitive with four state-of-the-art algorithms in terms of keeping the diversity of the individuals along the tradeoff surface, tending to extend the Pareto front to new areas and finding a well-approximated Pareto optimal front. 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