By Topic

Evolutionary Computation, 1996., Proceedings of IEEE International Conference on

Date 20-22 May 1996

Filter Results

Displaying Results 1 - 25 of 160
  • Proceedings of IEEE International Conference on Evolutionary Computation

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (1475 KB)
    Freely Available from IEEE
  • An interactive fuzzy satisficing method for multiobjective multidimensional 0-1 knapsack problems through genetic algorithms

    Publication Year: 1996, Page(s):243 - 246
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (461 KB)

    In this paper, an interactive fuzzy satisficing method for multiobjective multidimensional 0-1 knapsack problems is proposed by incorporating the desirable features of both the interactive fuzzy programming methods and genetic algorithms. By considering the vague nature of human judgements, fuzzy goals of the decision maker (DM) for objective functions are quantified by eliciting linear membership... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A clearing procedure as a niching method for genetic algorithms

    Publication Year: 1996, Page(s):798 - 803
    Cited by:  Papers (102)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (543 KB)

    The clearing procedure is a niching method inspired by the principle stated by J.H. Holland (1975) - that of sharing limited resources within subpopulations of individuals characterized by some similarities - but instead of evenly sharing the available resources among the individuals of a subpopulation, the clearing procedure supplies these resources only to the best individuals of each subpopulat... View full abstract»

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

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (180 KB)
    Freely Available from IEEE
  • Classification of the totalistic and the semitotalistic rules of cellular automata

    Publication Year: 1996, Page(s):748 - 753
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    In the context of finding relevant models for an artificial society, totalistic rules and semitotalistic rules of two-state cellular automata (CA) are studied by computer simulations, by utilizing a novel method of observing the time variation of an entropy-like function. We tabulated all the totalistic rules in two dimension and in one dimension for the case of five neighborhood CA. We have class... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of evolutionary computation to fuzzy algebra

    Publication Year: 1996, Page(s):592 - 595
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    Evolutionary programming is employed to perform the extension principle of fuzzy logic and to evaluate fuzzy algebraic expressions. The method is shown to be highly effective and it may play a promising role in the study of various fuzzy structures such as fuzzy vector spaces and fuzzy analytical geometry View full abstract»

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

    Publication Year: 1996, Page(s):744 - 747
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Optimal planning in an environment of multiple agents is mostly a highly dynamical process which can be characterized as a tradeoff between time and costs. This tradeoff can reach critical values and lead to a dilemma. We investigate this situation by using an ecosystem consisting of multiple agents which have to execute plans in order to fulfil their goals. Because resources are limited competiti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GA-based reconstruction of plane binary images

    Publication Year: 1996, Page(s):587 - 591
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    A GA-based technique for reconstructing plane binary images from four projection data is presented; its effectiveness is demonstrated by reconstructing two-dimensional objects from their one-dimensional coded images. The algorithm gets projection data from four different viewing angles. An initial population of matrices, each of which contains encodings of an image, is generated randomly. The typi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal trajectory planning of a redundant manipulator using evolutionary programming

    Publication Year: 1996, Page(s):738 - 743
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    A kinematically redundant robot manipulator has a lot of useful properties, such as avoiding singularities, obstacles and optimized motions, because the redundant manipulator has an infinite number of solutions of inverse kinematics. But, unfortunately it is very hard to get the solution of inverse kinematics when the manipulator is redundant. We propose two schemes which find the globally optimiz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Emergence of effective fuzzy rules for controlling mobile robots using DNA coding method

    Publication Year: 1996, Page(s):581 - 586
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    Studies the discovery of fuzzy rules for fuzzy inference systems with multiple inputs. Recently, many research studies on fuzzy inference systems using genetic algorithms have been done. However, it is difficult to find effective rules if the system has many inputs and outputs. We have proposed a new coding method based on biological DNA and a mechanism of development from artificial DNA. We call ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-adaptivity for constraint satisfaction: learning penalty functions

    Publication Year: 1996, Page(s):258 - 261
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (396 KB)

    Treating constrained problems with EAs is a very challenging problem. Whether one considers constrained optimization problems or constraint satisfaction problems, the presence of a fitness function (penalty function) reflecting constraint violation is essential. The definition of such a penalty function has a great impact on the GA performance, and it is therefore very important to choose it prope... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A combined evolutionary algorithm for real parameters optimization

    Publication Year: 1996, Page(s):732 - 737
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    Real-coded genetic algorithms (RCGAs) have proved to be more efficient than traditional bit-string genetic algorithms (GAs) in parameter optimization, but a RCGA focuses more on crossover operators and less on mutation operators for local searching. Evolution strategies (ESs) and evolutionary programming (EP) only concern the Gaussian mutation operators. This paper proposes a technique called a co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scatter search approach for unconstrained continuous optimization

    Publication Year: 1996, Page(s):643 - 648
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    Scatter search is a population based approach founded on ideas of spatial combination augmented by designs for exploiting memory. Introduced contemporaneously with early genetic algorithm proposals, and largely overlooked until recently, scatter search provides a historical bridge between evolutionary procedures and the adaptive memory strategies of tabu search. We exploit this bridge between adap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a multi-strategy approach in evolutionary computation

    Publication Year: 1996, Page(s):576 - 580
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    In this paper, we present a method based on possibility theory to deal with the optimization of dynamic problems or to increase the performance of the so-called evolutionary algorithms in the resolution of static problems. Two examples of the application of a such a multi-strategy approach are provided to show the interest of this methodology in evolutionary computation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polygonal approximation using genetic algorithm

    Publication Year: 1996, Page(s):469 - 474
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    Polygonal approximation is an important issue in pattern recognition and image processing. A new polygonal approximation method using a genetic algorithm is proposed. Genetic algorithms are search algorithms based on the mechanisms of natural selection and natural genetics. The chromosome is used to represent an approximated polygon and is represented by a binary string. Each bit, called gene, rep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence of evolutionary algorithms in general search spaces

    Publication Year: 1996, Page(s):50 - 54
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    This paper provides conditions under which evolutionary algorithms with an elitist selection rule will converge to the global optimum of some function whose domain may be an arbitrary space. These results generalize the previously developed convergence theory for binary and Euclidean search spaces to general search spaces View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A genetic-based method applied in fuzzy modeling

    Publication Year: 1996, Page(s):253 - 257
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    The identification of a fuzzy system model consists of two major phases: structure identification and parameter identification. The aim of the paper is to determine the main aspects involved in developing a flexible method able to learn and optimize both the structure and the parameters of a fuzzy inference system (FIS) with applications in fuzzy modeling. We propose a special kind of GA with vari... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolution of connection weights combined with local search for multi-layered neural network

    Publication Year: 1996, Page(s):726 - 731
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    The conventional backpropagation algorithm is basically a local search technique which uses the gradient information for convergence. However, it has the problems of local minima and slow convergence. Evolution of the connection weights based on backpropagation can effectively avoid these local minima and speed up the convergence rate. The idea is to perturb the network weights in a controlled man... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fuzzy-genetic controller for the flexible pole-cart balancing problem

    Publication Year: 1996, Page(s):223 - 228
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    This paper investigates the applicability of developing a controller based on genetic algorithms combined with fuzzy logic to control the flexible pole-cart balancing problem. The genetic algorithm is used to obtain the values of the variables required by the fuzzy logic controller, removing the need for expert knowledge. The system employs genetic search to extract the fuzzy rules and membership ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cluster evolution strategies. Enhancing the sampling density function using representatives

    Publication Year: 1996, Page(s):637 - 642
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    Most randomized search methods can be regarded as random sampling methods with a (nonuniform) sampling density function. Differences between the methods are reflected in different shapes of the sampling density function and in different adaptation mechanisms that update this density function based on the observed samples. We claim that this observation helps in getting a better understanding of ev... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polynomial complexity blackbox search: lessons from the SEARCH framework

    Publication Year: 1996, Page(s):792 - 797
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    The SEARCH (Search Envisioned As Relation and Class Hierarchizing) framework, developed by H. Kargupta (1995) offered an alternate perspective toward blackbox optimization-i.e. optimization in the presence of little domain knowledge. The SEARCH framework investigates the conditions that are essential for transcending the limits of random enumerative searching using a framework developed in terms o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-redundant genetic coding of neural networks

    Publication Year: 1996, Page(s):571 - 575
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    Feedforward neural networks have a number of functionally equivalent symmetries that make them difficult to optimise with genetic recombination operators. Although this problem has received considerable attention in the past, the proposed solutions all have a heuristic nature. We discuss a neural network genotype representation that completely eliminates the functional redundancies by transforming... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelization of a genetic algorithm for image restoration and its performance analysis

    Publication Year: 1996, Page(s):463 - 468
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    The parallelization of a genetic algorithm for image restoration on a multiprocessor computing system is presented and its performance is evaluated in a multi-workstation environment. The results show a significant reduction of computing time due to the parallelism View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolutionary robotics-an overview

    Publication Year: 1996, Page(s):40 - 49
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1088 KB)

    The field of evolutionary robotics (ER) emerged as an important recent addition to intelligent robotic research in the early 1990s. It currently deals mostly with the evolution of control software for mobile robots with the goal of developing competent robots that perform tasks well adapted to the requirements in a given operational environment and is also being extended to hardware evolution. Thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Breeder genetic algorithms for airfoil design optimisation

    Publication Year: 1996, Page(s):71 - 75
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (416 KB)

    In this paper a version of genetic algorithms, the breeder genetic algorithms, suitable for continuous parameter optimisation, has been applied and compared to a classical discrete genetic algorithm. The application concerns a typical optimisation problem in aerodynamics, the problem of determining the coordinates of an airfoil given a surface pressure distribution. Our results have shown that the... View full abstract»

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