By Topic

First International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications

12-14 Sep 1995

Filter Results

Displaying Results 1 - 25 of 93
  • Towards the open ended evolution of neural networks

    Publication Year: 1995, Page(s):388 - 393
    Cited by:  Papers (4)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (524 KB)

    A framework is described that allows the completely open-ended evolution of neural network architectures, based on an active weight neural network model. In this approach, there is no separate learning algorithm; learning proceeds (if at all) as an intrinsic part of the network behaviour. This has interesting application in the evolution of neural nets, since now it is possible to evolve all aspec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GA consistently deceptive functions are not challenging problems

    Publication Year: 1995, Page(s):357 - 364
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (532 KB)

    Das and Whitley have shown that functions which are easy in theory for genetic algorithms (GA) can be easily optimized with a global search method (Das and Whitley, 1991). In this paper, we show that this global search method can be simply adapted in order to solve also GA-hard functions and more generally consistently deceptive functions. The resulting algorithm, called GSC1, generates a set of b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The table: an illustration of evolutionary design using genetic algorithms

    Publication Year: 1995, Page(s):412 - 418
    Cited by:  Papers (4)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (1540 KB)

    This paper describes an attempt to enable computers to generate truly novel conceptual designs of solid objects by using genetic algorithms (GAs). The current capabilities of the system are illustrated by the example of designing a table. Each individual table has its functionality specified by an explicit objective function, which is utilised by GAs to evolve candidate designs. These designs are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ISAR image focusing using a genetic algorithm

    Publication Year: 1995, Page(s):385 - 387
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (284 KB)

    This paper presents the use of Genetic Algorithms as a search method for Inverse Synthetic Aperture Radar (ISAR) image focusing. Although motion estimation using joint time-frequency representations allows much of the blurring to be removed, there remain noticeable effects due to imperfect compensation. The Genetic Algorithm is used as a fine tuning process in which a measure of focus is used as t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling the behaviour of the genetic algorithm

    Publication Year: 1995, Page(s):349 - 356
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (584 KB)

    This paper presents an overview of the theoretical foundations of the genetic algorithm. It aims to provide those interested in applying GAs to real-world problems with a feel for the techniques that can be employed to analyze and control genetic-based optimizers and control systems. In addition to a review of schema, Walsh-function and statistical mechanics-based methods the paper introduces a mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An application of genetic algorithms for general dynamic lotsizing problems

    Publication Year: 1995, Page(s):82 - 87
    Cited by:  Papers (3)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (376 KB)

    This paper presents an application of genetic algorithms for dynamic lotsizing problems, including the implementation methodology and the testing results of the algorithms. Currently, most of the existing studies for dynamic lotsizing problems concentrate on heuristic lot-sizing techniques which only consider some simple production structures and/or simple external demands structures. In this pape... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A genetic algorithm with multi-step crossover for job-shop scheduling problems

    Publication Year: 1995, Page(s):146 - 151
    Cited by:  Papers (16)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (524 KB)

    Genetic algorithms (GAs) have been designed as general purpose optimization methods. GAs can be uniquely characterized by their population-based search strategies and their operators: mutation, selection and crossover. In this paper, we propose a new crossover called multi-step crossover (MSX) which utilizes a neighborhood structure and a distance in the problem space. Given parents, MSX successiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perceptual content loss in bit rate constrained IFS encoding of speech

    Publication Year: 1995, Page(s):325 - 330
    Cited by:  Patents (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (444 KB)

    This paper presents investigations into a fractal speech encoder, concentrating on the performance of this type of system if bit rate restrictions apply. The parameters that significantly affect both the performance and bit rate are studied, along with bit allocation schemes and quantisation of the transmitted coefficients. In order to quantify the quality of the system, a psychoacoustic measure i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structured messy genetic algorithm approach for the optimal improvement of water distribution systems

    Publication Year: 1995, Page(s):406 - 411
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (440 KB)

    A structured messy genetic algorithm (SMGA) has been developed for finding the optimal way of investing a fixed budget for improvement of a water distribution network. The SMGA successfully identifies (and designs) a small, near-optimal, subset of elements to be added or improved from the much larger set of all network elements View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of synchronisation sequences for mobile radio applications using genetic algorithms

    Publication Year: 1995, Page(s):379 - 384
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (588 KB)

    This paper discusses the application of Genetic Algorithms (GAs) to the problem of searching for a set of synchronisation codes for TDMA based mobile radio systems. The problem may be formulated as a constrained optimisation problem and is transformed into an unconstrained one by including a penalty term within the fitness function. The quality of the sequences obtained, using the genetic algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic algorithms and filtering

    Publication Year: 1995, Page(s):343 - 348
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (356 KB)

    An improvement to a genetic algorithm used in constructing an IIR digital filter is presented. The aims of our improvement are the reconstruction of genetic operators and a new procedure for initial population selection applied to the filter design problem. The result is a modified genetic algorithm which allows us to find the best IIR filter amongst all filters with the required transfer function... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of 2-D multiplierless FIR filters using genetic algorithms

    Publication Year: 1995, Page(s):282 - 286
    Cited by:  Papers (5)  |  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (284 KB)

    This paper considers the design of reduced complexity two-dimensional FIR filters using genetic algorithms (GAs). Circularly symmetric and diamond shaped low-pass linear phase FIR filters are designed using coefficients comprising the sum or difference of two power-of-two terms. A minimax error criterion is adopted which leads to a minimisation of the weighted ripple extrema in both pass and stop ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a genetic algorithm to evolve an optimum input set for a predictive neural network

    Publication Year: 1995, Page(s):256 - 258
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (272 KB)

    This paper describes an investigation into using a genetic algorithm to evolve the optimum set of inputs for a neural network. The network is to be used in a novel way for the prediction of nuclear reactor parameters under fault conditions. The development of transients is calculated in a recursive manner. The previous work and the next stage of research are described. The procedure and genetic al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Accelerating genetic algorithms: protected chromosomes and parallel processing

    Publication Year: 1995, Page(s):76 - 81
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (460 KB)

    This paper proposes a new method for speeding up genetic algorithms (GAs) by temporarily protecting some components of chromosomes from ordinary genetic operators such as crossover and mutation. Protecting some components of chromosomes can reduce the search space, speeding up GAs that use this method. This new method is implemented on a subpopulation-type parallelised genetic algorithm. Each subp... View full abstract»

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

    Publication Year: 1995
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (108 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chaotic system identification via genetic algorithm

    Publication Year: 1995, Page(s):170 - 174
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (308 KB)

    In this paper a novel approach for identifying the asymptotic behaviour of non-linear chaotic dynamic systems is proposed. The problem has been faced like an optimisation procedure and it has been solved by using the genetic algorithm approach. Given the asymptotic time evolution of the state variables of the non-linear system that has to be identified, they are used to synchronise another system ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic auto-tuning of PID controllers

    Publication Year: 1995, Page(s):141 - 145
    Cited by:  Papers (7)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (360 KB)

    The technique of genetic algorithms is proposed as a means of auto-tuning PID controllers. The technique involves firstly using on-line data and the genetic algorithm to identify a model of the process. Then the identified model, the genetic algorithm and simulation methods, are used to off-line tune the PID controller, so as to minimise a time-domain based cost function. Finally, the genetically ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Charley: a genetic algorithm for the design of mesh networks

    Publication Year: 1995, Page(s):118 - 122
    Cited by:  Patents (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (360 KB)

    This paper presents a genetic algorithm for the design of an optimal mesh network. The problem is of relevance in the design of communication networks where the backbone switching network takes the form of a highly connected mesh in order to provide reliability in the event of switch/link failure. The proposed algorithm addresses two important aspects of the problem-topology design and capacity al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel genetic VLSI architecture for combinatorial real-time applications-disc scheduling

    Publication Year: 1995, Page(s):493 - 498
    Cited by:  Papers (8)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (476 KB)

    Parallel genetic algorithms (PGAs) provide a means of rapidly developing a solution to a wide range of problems. In particular the parallel genetic algorithm has the potential for solving problems far faster than conventional genetic algorithm (GA). Despite these advantages real time applications are rarely discussed in the GA literature. In principle a hardware version of the PGA could cope with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The algorithms of natural vision: the multi-channel gradient model

    Publication Year: 1995, Page(s):319 - 324
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (720 KB)

    Nature, through the process of evolution, has developed strategies for the processing of visual information. These algorithms have been optimised over eons to maximise the organism's ability to survive in the real world. Hence, the techniques employed are efficient, environmentally robust and practical for implementation in the parallel architecture of the brain. Primate and human visual perceptio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • H design of an EMS control system for a maglev vehicle using evolutionary algorithms

    Publication Year: 1995, Page(s):226 - 231
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (408 KB)

    An evolutionary algorithm approach is proposed for the H design of an EMS control system for a maglev vehicle. The algorithm is used in conjunction with an H loop-shaping design procedure to search over a space of possible weighting function structures and parameter values in order to satisfy a number of conflicting design criteria View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of genetic techniques to the planning of railway track maintenance work

    Publication Year: 1995, Page(s):467 - 472
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (444 KB)

    Track maintenance work was planned using genetic algorithm (GA) and genetic programming (GP) methods, with profit as the optimisation criteria. The results were compared with an existing deterministic technique. It was found that the GP method gave the best results, with the GA method giving good results for a short section and poor results for a long section of track View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of genetic algorithms to pump scheduling for water supply

    Publication Year: 1995, Page(s):400 - 405
    Cited by:  Papers (10)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (516 KB)

    A simple Genetic Algorithm has been applied to the scheduling of multiple pumping units in a water supply system with the objective of minimising the overall cost of the pumping operation, taking advantage of storage capacity in the system and the availability of off peak electricity tariffs. A simple example shows that the method is easy to apply and has produced encouraging preliminary results View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed spectrum frequency assignment using natural algorithms

    Publication Year: 1995, Page(s):373 - 378
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (376 KB)

    The frequency assignment problem, known to be NP-complete, is to find an assignment of radio frequencies to a set of transmitters in a region. The transmitters satisfy a large number of constraints. This paper presents a simulated annealing algorithm for determining such an assignment and compares the results with those obtained from a genetic algorithm. We report on our computational experiments ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of genetic algorithms to the optimisation of adaptive antenna arrays and radar absorbers

    Publication Year: 1995, Page(s):94 - 99
    Cited by:  Papers (138)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (444 KB)

    Genetic algorithms (GAs) have emerged as an effective adaptive search techniques based on the concept of natural selection. The power of GAs in optimisation has become apparent from the wide range of applications identified in the areas of automatic and adaptive control, but only a few authors have reported on their application to the optimisation of electromagnetic structures. In this paper, we r... View full abstract»

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