By Topic

A constructive genetic algorithm for gate matrix layout problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
A. C. M. de Oliveira ; Departamento de Informatica, Univ. Fed. do Maranhao, Sao Luis, MA, Brazil ; L. A. N. Lorena

This paper describes an application of a Constructive Genetic Algorithm (CGA) to the gate matrix layout problem (GMLP). The GMLP happens in very large scale integration design and can be described as a problem of assigning a set of circuit nodes (gates) in an optimal sequence, such that the layout area is minimized, as a consequence of optimizing the number of tracks necessary to cover the gates interconnection. The CGA has a number of new features compared to a traditional genetic algorithm. These include a population of dynamic size composed of schemata and structures and the possibility of using heuristics in structure representation and in the fitness function definitions. The application of CGA to GMLP uses a 2-Opt-like heuristic to define the fitness functions and the mutation operator. Computational tests are presented using available instances taken from the literature.

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:21 ,  Issue: 8 )