Transactions of the Institute of Systems, Control and Information Engineers
Online ISSN : 2185-811X
Print ISSN : 1342-5668
ISSN-L : 1342-5668
An Imanishism-based Genetic Algorithm for Seeking Various Optimal Solutions of the Module Placement Problem
Kiyoharu TAGAWAKoji MIZUTANIKatsumi INOUEHiromasa HANEDA
Author information
JOURNALS FREE ACCESS

2001 Volume 14 Issue 10 Pages 467-474

Details
Abstract

In order to find the plural number of optimal solutions for the module placement problem, which is of particular significance in the design of VLSI, a new Genetic Algorithm (GA) based on Imanishi's evolutionary theory is proposed. First of all, a phenotypic distance between two solutions, or individuals, is defined as the shortest Hamming distance between sets of isomorphic genotypes. If the phenotypic distance between two individuals is shorter than a threshold value, they are regarded as the same species. Then, a new generation alternation model that is analogous to the habitat segregation is presented. Since each individual in the population represents an isolating species, the diversity of the population is maintained spontaneously. Even though the selection of individuals based on their fitness is not employed, excellent individuals are created effectively by using the harmonic crossover operation combined with a local optimization method.

Information related to the author
© The Institute of Systems, Control and Information Engineers
Next article
feedback
Top