Extraction and reuse of design patterns from genetic algorithms using case-based reasoning

  • Authors:
  • E. I. Pérez;C. A. C. Coello;A. H. Aguirre

  • Affiliations:
  • Instituto de Investigaciones EléctricasAv. Reforma, #113 Col. Palmira, 62490, Temixco Morelos, MEXICO;Av. Instituto Politécnico Nacional, CINVESTAV-IPN Departamento de Ingeniería Eléctrica Sección de Computación, No. 2508 Col. San, D.F. 07300, Pedro Zacatenco M&# ...;Centro de Investigación en Matemáticas Área Computación Callejón Jalisco s/n Mineral de Valenciana Guanajuato, CINVESTAV-IPN Dept. de Ing. Eléc. Secc. de ...

  • Venue:
  • Soft Computing - A Fusion of Foundations, Methodologies and Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a case-based reasoning scheme in which we extract domain knowledge (in the form of design patterns) from a genetic algorithm used to optimize combinational logic circuits at the gate level. Such information is used in two ways: first, we show how the selection pressure of the genetic algorithm is biased by Boolean simplification rules that are normally adopted by human designers, including some which are not completely straightforward. Secondly, we reuse some of these design patterns extracted from the evolutionary process to reduce convergence times of a genetic algorithm using previously found solutions as cases to solve similar problems.