Skip to main content

Advertisement

Log in

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

  • Published:
Soft Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to E. I. Pérez.

Additional information

The second author acknowledges support from CONACyT through project No. 32999-A. The third author acknowledges partial support for this work through CONACyT Project No. I-39324-A.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pérez, E., Coello, C. & Aguirre, A. Extraction and reuse of design patterns from genetic algorithms using case-based reasoning. Soft Computing 9, 44–53 (2005). https://doi.org/10.1007/s00500-003-0333-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-003-0333-8

Keywords

Navigation