A constructive genetic algorithm for gate matrix layout problems

Authors:
A. C.M. de Oliveira;L. A.N. Lorena
Affiliations:
Departamento de Informatica, Univ. Fed. do Maranhao, Sao Luis, MA;-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 5

Fingerprint matching by genetic algorithms

Pattern Recognition
Lossless data hiding for color images based on block truncation coding

Pattern Recognition
A Constructive Genetic Algorithm for permutation flowshop scheduling

Computers and Industrial Engineering
Population training heuristics

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Pattern sequencing problems by clustering search

IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.03

Visualization

Abstract

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.