Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)

19-23 June 2004

Go

Filter Results

Displaying Results 1 - 25 of 176
  • Alternative fuel adoption

    Publication Year: 2004, Page(s):2364 - 2371 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (626 KB) | HTML iconHTML

    Conversion from a widely-used automotive fuel to an alternative fuel can be seen as the coevolution of two systems: a societal system of vehicle owners and a supply infrastructure that will provide the alternative fuel. We present a cultural algorithms model that allows us to assess the impact that initial alternative fuel station distribution and cultural motivation have on alternative fuel adopt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolution strategies for multivariate-to-anything partially specified random vector generation

    Publication Year: 2004, Page(s):2235 - 2240 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (448 KB) | HTML iconHTML

    Multivariate-to-anything methods for partially specified random vector generation work by transforming samples from a driving distribution into samples characterized by given marginals and correlations. The correlations of the transformed random vector are controlled by the driving distribution; sampling a partially specified random vector requires finding an appropriate driving distribution. This... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Swarm guidance using a multi-objective co-evolutionary on-Line evolutionary algorithm

    Publication Year: 2004, Page(s):2357 - 2363 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (533 KB) | HTML iconHTML

    This paper details the application of a multi-objective cooperative co-evolutionary on-line EA (MOC-COLEA) to the guidance of a swarm of multiple missiles, against multiple targets. The multi-objective algorithm is used to develop a dynamic objective front which is used to trade the spatial distribution of missiles at impact, against the time to impact. Each missile optimises its own performance, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized LDA using relevance weighting and evolution strategy

    Publication Year: 2004, Page(s):2230 - 2234 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (386 KB) | HTML iconHTML

    In pattern classification area, linear discriminant analysis (LDA) is one of the most traditional methods to find a linear solution to the feature extraction problem, which maximise the ratio between between-class scatter and the within class scatter (Fisher's criterion). We propose a variant of LDA which incorporates the class conjunctions thereby making LDA more robust for the problems in which ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling coevolutionary genetic algorithms on two-bit landscapes: partnering strategies

    Publication Year: 2004, Page(s):2349 - 2356 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (586 KB) | HTML iconHTML

    Different from standard genetic algorithms where each individual is evaluated separately according to predefined objective function(s), one most notable characteristic of coevolutionary genetic algorithms (CGA) is that evaluation procedures require more than one individual and an individual's fitness is depending on its interactions with its partners. In consequence, the implemented partnering str... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-objective optimisation of bijective s-boxes

    Publication Year: 2004, Page(s):1525 - 1532 Vol.2
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB) | HTML iconHTML

    In This work we investigate the heuristic construction of bijective s-boxes that satisfy a wide range of cryptographic criteria including algebraic complexity, high nonlinearity, low autocorrelation and have none of the known weaknesses including linear structures, fixed points or linear redundancy. We demonstrate that the power mappings can be evolved (by iterated mutation operators alone) to gen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trajectory generation and accumulation for partner robots based on structured learning

    Publication Year: 2004, Page(s):2224 - 2229 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    The aim of This work is to develop partner robots that can obtain and accumulate human-friendly behaviors. To realize it, we use a concept of structured learning which emphasizes the importance of an interactive learning of several modules through interaction with its environment. In a proposed method, a robot obtains hand-to-hand behavior by using an interactive evolutionary computation based on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a bounded Pareto-coevolution archive

    Publication Year: 2004, Page(s):2341 - 2348 Vol.2
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (638 KB) | HTML iconHTML

    Convolution offers adaptive methods for the selection of tests used to evaluate individuals, but the resulting evaluation can be unstable. Recently, general archive-based coevolution methods have become available for which monotonic progress can be guaranteed. The size of these archives may grow indefinitely however, thus limiting their application potential. Here, we investigate how the size of a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Searching for cost functions

    Publication Year: 2004, Page(s):1517 - 1524 Vol.2
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB) | HTML iconHTML

    Boolean function design is at the heart of cryptography, and is the subject of a great deal of theoretical research. We have use a simulated annealing approach to find functions with particular desirable cryptographic properties; for functions of a small number of variables, results with properties as good as (and sometimes better than) the best so far have been achieved. The success of this appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Handling equality constraints by adaptive relaxing rule for swarm algorithms

    Publication Year: 2004, Page(s):2012 - 2016 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB) | HTML iconHTML

    The adaptive constraints relaxing rule for swarm algorithms to handle with the problems with equality constraints is presented. The feasible space of such problems may be similiar to ridge function class, which is hard for applying swarm algorithms. To enter the solution space more easily, the relaxed quasi feasible space is introduced and shrinked adaptively. The experimental results on benchmark... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial recombination for the co-evolution of model parameters

    Publication Year: 2004, Page(s):2216 - 2223 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB) | HTML iconHTML

    Partial recombination is a type of crossover for genetic algorithms that focuses on a subset of the chromosome. It provides a means of doing crossover were only the genes involved in producing the fitness are affected. In this paper, we use it to evolve the parameters for a model that represents the capabilities of a robot. The values of these parameters are evolved as the robot periodically perfo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel memetic algorithm with random multi-local-search: a case study of TSP

    Publication Year: 2004, Page(s):2335 - 2340 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB) | HTML iconHTML

    Memetic algorithms (MAs) have been shown to be very effective in finding near optimal solutions to hard combinatorial optimization problems. We propose a novel memetic algorithm (MsMA), in which a new local search scheme is introduced. We called this local search scheme as random multi-local-search (MLS). The MLS is composed of several local search schemes, each of which executes with a predefined... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Face detection using quantum-inspired evolutionary algorithm

    Publication Year: 2004, Page(s):2100 - 2106 Vol.2
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB) | HTML iconHTML

    This work proposes a new face detection system using quantum-inspired evolutionary algorithm (QEA). The proposed detection system is based on elliptical blobs and principal component analysis (PCA). The elliptical blobs in the directional image are used to find the face candidate regions, and then PCA and QEA are employed to verify faces. Although PCA related algorithms have shown outstanding perf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the design of state-of-the-art pseudorandom number generators by means of genetic programming

    Publication Year: 2004, Page(s):1510 - 1516 Vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB) | HTML iconHTML

    The design of pseudorandom number generators by means of evolutionary computation is a classical problem. Today, it has been mostly and better accomplished by means of cellular automata and not many proposals, inside or outside this paradigm could claim to be both robust (passing all the statistical tests, including the most demanding ones) and fast, as is the case of the proposal we present here.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High performance clustering with differential evolution

    Publication Year: 2004, Page(s):2004 - 2011 Vol.2
    Cited by:  Papers (30)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (522 KB) | HTML iconHTML

    Partitional clustering poses a NP hard search problem for non-trivial problems. While genetic algorithms (GA) have been very popular in the clustering field, particle swarm optimization (PSO) and differential evolution (DE) are rather unknown. We report results of a performance comparison between a GA, PSO and DE for a medoid evolution clustering approach. Our results show that DE is clearly and c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical surrogate-assisted evolutionary optimization framework

    Publication Year: 2004, Page(s):1586 - 1593 Vol.2
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (598 KB) | HTML iconHTML

    This work presents enhancements to a surrogate-assisted evolutionary optimization framework proposed earlier in the literature for solving computationally expensive design problems on a limited computational budget (Ong et al., 2003). The main idea of our former framework was to couple evolutionary algorithms with a feasible sequential quadratic programming solver in the spirit of Lamarckian learn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An evolutionary algorithm for multi-robot unsupervised learning

    Publication Year: 2004, Page(s):2210 - 2215 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB) | HTML iconHTML

    Based on evolutionary computation principles, an algorithm is presented for learning safe navigation of multiple robot systems. It is a basic step towards automatic generation of sensorimotor control architectures for completing complex cooperative tasks while using simple reactive mobile robots. Each individual estimates its own performance, without requiring any supervision. When two robots meet... View full abstract»

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

    Publication Year: 2004, Page(s):1427 - 1434 Vol.2
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB) | HTML iconHTML

    Blackjack is a casino game that affords the player an opportunity to have an advantage over the house. The player can play a "basic strategy" that offers an approximately break-even wager. When also taking the distribution of cards played in prior hands into account, the odds can favor the player. Well-known playing strategies have been developed by examining different situations in the game and c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bi-criteria model for locating a semi-desirable facility on a plane using particle swarm optimization

    Publication Year: 2004, Page(s):2328 - 2334 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (415 KB) | HTML iconHTML

    The problem of locating a semi-desirable facility on a plane is considered. A bi-criteria model is used. One of the criteria is well known minimum criterion. The second criterion is a weighted sum of Euclidean distances raised to the power of negative one. This function represents the aggregate undesirable effects of the facility and it is also a minimization problem. The bi-criteria model consist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Texture analysis by genetic programming

    Publication Year: 2004, Page(s):2092 - 2099 Vol.2
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (617 KB) | HTML iconHTML

    This work presents the use of genetic programming (GP) to a complex domain, texture analysis. Two major tasks of texture analysis, texture classification and texture segmentation, are studied. Bitmap textures are used in this investigation. In classification tasks, the results show that GP is able to evolve accurate classifiers based on texture features. Moreover by using the presented method, GP ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Criteria for designing crossovers for TSP

    Publication Year: 2004, Page(s):1465 - 1472 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (547 KB) | HTML iconHTML

    This work proposes criteria for designing crossovers for genetic algorithms (GAs) used to solve traveling salesman problems (TSPs). These criteria are [1] that the ratio at which new edges are introduced into offspring by crossovers should be adjusted appropriately and [2] that the quality of the new edges should be high. The validity of these criteria is demonstrated by comparing several crossove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-objective fast messy genetic algorithm solving deception problems

    Publication Year: 2004, Page(s):1502 - 1509 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (551 KB) | HTML iconHTML

    Deception problems are among the hardest problems to solve using ordinary genetic algorithms. Recent studies show that Bayesian optimization can help in solving these problems. This work compares the results acquired from the multiobjective fast messy genetic algorithm (MOMGA-II), multiobjective Bayesian optimization algorithm (mBOA), and the nondominated sorting genetic algorithm-II (NSGA-II) whe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic algorithms for parallel code optimization

    Publication Year: 2004, Page(s):1375 - 1381 Vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB) | HTML iconHTML

    Determining the optimum data distribution, degree of parallelism and the communication structure on distributed memory machines for a given algorithm is not a straightforward task. Assuming that a parallel algorithm consists of consecutive stages, a genetic algorithm is proposed to find the best number of processors and the best data distribution method to be used for each stage of the parallel al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive probabilities of crossover and mutation in genetic algorithms based on clustering technique

    Publication Year: 2004, Page(s):2280 - 2287 Vol.2
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB) | HTML iconHTML

    Research on adjusting the probabilities of crossover px and mutation pm in genetic algorithms (GA's) is one of the most significant and promising areas of investigation in evolutionary computation, since px and pm greatly determine whether the algorithm will find a near-optimum solution or whether it will find a solution efficiently. Instead of having fi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhanced simulated evolution algorithm for digital circuit design yielding faster execution in a larger solution space

    Publication Year: 2004, Page(s):1794 - 1799 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (445 KB) | HTML iconHTML

    Evolutionary algorithms have been studied by several researchers for the design of digital circuits. Simulated evolution (SimE) is used in This work due to it simplicity and customizability to combinatorial problems. A tree data structure based circuits are evolved. Thus, a larger solution space is investigated. In addition, a new pattern based goodness measure is presented. View full abstract»

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