Abstract
In this paper we show a scheme based on case-based reasoning to extract design patterns from a genetic algorithm used to optimize combinational circuits at the gate-level. The approach is able to rediscover several of the traditional Boolean rules used for circuit simplification and it also finds new simplification rules. Also, we illustrate how the approach can be used to reduce convergence times of a genetic algorithm using previously found solutions as cases to solve similar problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. A. Coello Coello, A. D. Christiansen, and A. Hernández Aguirre. Use of Evolutionary Techniques to Automate the Design of Combinational Circuits. International Journal of Smart Engineering System Design, 2(4):299–314, June 2000.
V. Kolodner. Case Based Reasoning. Morgan Kaufmann Publishers, San Mateo, California, 1993.
X. Liu. Combining Genetic Algorithms and Case-based Reasoning for Structure Design. Master’s thesis, Department of Computer Science, University of Nevada, 1996.
S. J. Louis. Genetic Algorithms as a Computational Tool for Design. PhD thesis, Department of Computer Science, Indiana University, August 1993.
S. J. Louis and J. Johnson. Solving Similar Problems using Genetic Algorithms Case-Based Memory. In Thomas Bäck, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 283–290, San Francisco, California, 1997. Morgan Kaufmann Publishers.
S. J. Louis, G. McGraw, and R. Wyckoff. Case-based reasoning assisted explanation of genetic algorithm results. Journal of Experimental and Theoretical Artificial Intelligence, 5:21–37, 1993.
J. Miller, T. Kalganova, N. Lipnitskaya, and D. Job. The Genetic Algorithm as a Discovery Engine: Strange Circuits and New Principles. In Proceedings of the AISB Symposium on Creative Evolutionary Systems (CES’99), Edinburgh, UK, 1999.
E. Islas Pérez. Development of a Learning Platform using Case Based Reasoning and Genetic Algorithms. Case Study: Optimization of Combinational Logic Circuits. Master’s thesis, Maestría en Inteligencia Artificial, Facultad de Física e Inteligencia Artificial, Universidad Veracruzana, November 2000.
C. L. Ramsey and J. J. Grefenstette. Case-Based Initialization of Genetic Algorithms. In Stephanie Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 84–91, San Mateo, California, 1993. Morgan Kauffman Publishers.
J. W. Sheppard and S. L. Salzberg. Combining Genetic Algorithms with Memory Based Reasoning. In Larry Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 452–459, San Francisco, California, July 1995. Morgan Kaufmann.
P. Thomson. Circuit Evolution and Visualisation. In Julian Miller, Adrian Thompson, Peter Thomson, and Terence C. Fogarty, editors, Evolvable Systems: From Biology to Hardware, pages 229–240. Springer-Verlag, Edinburgh, Scotland, April 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pérez, E.I., Coello, C.A.C., Aguirre, A.H. (2001). Extraction of Design Patterns from Evolutionary Algorithms Using Case-Based Reasoning. In: Liu, Y., Tanaka, K., Iwata, M., Higuchi, T., Yasunaga, M. (eds) Evolvable Systems: From Biology to Hardware. ICES 2001. Lecture Notes in Computer Science, vol 2210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45443-8_22
Download citation
DOI: https://doi.org/10.1007/3-540-45443-8_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42671-4
Online ISBN: 978-3-540-45443-4
eBook Packages: Springer Book Archive