Hardware implementation of a novel genetic algorithm

—This paper presents a novel genetic algorithm, termed the Optimum Individual Monogenetic Algorithm (OIMGA) and describes its hardware implementation. As the monogenetic strategy retains only the optimum individual, the memory requirement is dramatically reduced and no crossover circuitry is needed, thereby ensuring the requisite silicon area is kept to a minimum. Consequently, depending on application requirements, OIMGA allows the investigation of solutions that warrant either larger GA populations or individuals of greater length. The results given in this paper demonstrate that both the performance of OIMGA and its convergence time are superior to those of existing hardware GA implementations. Local convergence is achieved in OIMGA by retaining elite individuals, while population diversity is ensured by continually searching for the best individuals in fresh regions of the search space. Keywords—Genetic algorithms, hardware-based machine learning.

• Type: Journal
• Year: 2007
• Where: IJON
• Authors: Z. Zhu, D. J. Mulvaney, Vassilios A. Chouliaras
• Keywords: IJON 2007, Individual Monogenetic Algorithm, Optimum Individual, Requisite Silicon Area