Comparative study of serial and parallel heuristics used to design combinational logic circuits

In this article, we perform a comparative study of different heuristics used to design combinational logic circuits. This study mainly emphasizes the use of local search hybridized with a genetic algorithm (GA) and the impact of introducing parallelism. Our results indicate that a hybridization of a GA with a local search algorithm (simulated annealing) is beneficial and that the use of parallelism not only introduces a speedup in the algorithms compared (as expected) but also allows us to improve the quality of the solutions found.

[1]  Vladimír Kvasnička,et al.  A hybrid of simplex method and simulated annealing , 1997 .

[2]  Julian Francis Miller,et al.  Information Characteristics and the Structure of Landscapes , 2000, Evolutionary Computation.

[3]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[4]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[5]  Adam Slowik,et al.  Design and Optimization of Combinational Digital Circuits Using Modified Evolutionary Algorithm , 2004, ICAISC.

[6]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[7]  Emile H. L. Aarts,et al.  Selected Topics in Simulated Annealing , 2002 .

[8]  Julian Francis Miller,et al.  Principles in the Evolutionary Design of Digital Circuits—Part II , 2000, Genetic Programming and Evolvable Machines.

[9]  Patrick Siarry,et al.  Tabu Search applied to global optimization , 2000, Eur. J. Oper. Res..

[10]  Enrique Alba,et al.  A survey of parallel distributed genetic algorithms , 1999, Complex..

[11]  E. W. Veitch,et al.  A chart method for simplifying truth functions , 1952, ACM '52.

[12]  Peter Nordin,et al.  Genetic programming - An Introduction: On the Automatic Evolution of Computer Programs and Its Applications , 1998 .

[13]  Sushil J. Louis,et al.  Genetic algorithms as a computational tool for design , 1993 .

[14]  Nripendra N. Biswas,et al.  Minimization of Boolean Functions , 1971, IEEE Transactions on Computers.

[15]  Masao Fukushima,et al.  Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization , 2002, Optim. Methods Softw..

[16]  Tsutomu Sasao,et al.  Logic Synthesis and Optimization , 1997 .

[17]  Carlos A. Coello Coello,et al.  Use of Particle Swarm Optimization to Design Combinational Logic Circuits , 2003, ICES.

[18]  Estudios Avanzados,et al.  Diseno de circuitos logicos combinatorios usando optimizacion mediante cumulos de part´õculas , 2004 .

[19]  Enrique Alba,et al.  Parallelism and evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

[20]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[21]  E. Pérez.  Diseño de circuitos lógicos combinatorios utilizando programación genética , 2001 .

[22]  Carlos A. Coello Coello,et al.  Ant Colony System for the Design of Combinational Logic Circuits , 2000, ICES.

[23]  Vesselin K. Vassilev,et al.  Digital circuit evolution and fitness landscapes , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[24]  Shu-Kai S. Fan,et al.  Hybrid simplex search and particle swarm optimization for the global optimization of multimodal functions , 2004 .

[25]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[26]  Sadiq M. Sait,et al.  Digital circuit design through simulated evolution (SimE) , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[27]  Carlos A. Coello Coello,et al.  Extracting and re-using design patterns from genetic algorithms using case-based reasoning , 2003 .

[28]  Carlos A. Coello Coello,et al.  Design of combinational logic circuits through an evolutionary multiobjective optimization approach , 2002, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[29]  A. H. Aguirre,et al.  AUTOMATED DESIGN OF COMBINATIONAL LOGIC CIRCUITS USING GENETIC ALGORITHMS , 2022 .

[30]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[31]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[32]  M. Karnaugh.  The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[33]  Carlos A. Coello Coello,et al.  Evolutionary multiobjective design of combinational logic circuits , 2000, Proceedings. The Second NASA/DoD Workshop on Evolvable Hardware.

[34]  Masao Fukushima,et al.  Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization , 2004, Optim. Methods Softw..

[35]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[36]  Sadiq M. Sait,et al.  A modified ant colony algorithm for evolutionary design of digital circuits , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[37]  Marc Ebner,et al.  Evolvable Hardware , 2004, Künstliche Intell..

[38]  Julian F. Miller.  Chapter 18 – The Genetic Algorithm as a Discovery Engine: Strange Circuits and New Principles , 2002 .

[39]  Larry J. Eshelman,et al.  The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.