Kagan Tumer's Publications

Display Publications by [Year] [Type] [Topic]


Designing Genetic Algorithms for the State Assignment Problem. J. N. Amaral, K. Tumer, and J. Ghosh. IEEE Transactions on Systems, Man and Cybernetics, 25(4):687–695, April 1995.

Abstract

Finding the best state assignment for implementing a synchronous sequential circuit is important for reducing silicon area or chip count in many digital designs. This State Assignment Problem (SAP) belongs to a broader class of combinatorial optimization problems than the well studied traveling salesman problem, which can be formulated as a special case of SAP. The search for a good solution is considerably involved for the SAP due to a large number of equivalent solutions, and no effective heuristic has been found so far to cater to all types of circuits. In this paper, a matrix representation is used as the genotype for a Genetic Algorithm (GA) approach to this problem. A novel selection mechanism is introduced, and suitable genetic operators for crossover and mutation, are constructed. The properties of each of these elements of the GA are discussed and an analysis of parameters that influence the algorithm is given. A canonical form for a solution is defined to significantly reduce the search space and number of local minima. Experiments with several examples show that the GA approach yields results that are often comparable to, or better than those obtained using established heuristics that embody extensive domain knowledge.

Download

[PDF]116.0kB  

BibTeX Entry

@article{tumer-amaral_ieeesmc95,
	author={J. N. Amaral and K. Tumer and J. Ghosh},
	title={Designing Genetic Algorithms for the State Assignment Problem},
	journal={IEEE Transactions on Systems, Man and Cybernetics},
	volume={25},
	number={4},
	pages={687-695},
	month={April},
	abstract = {Finding the best state assignment for implementing a synchronous sequential circuit is important for reducing silicon area or chip count in many digital designs. This State Assignment Problem (SAP) belongs to a broader class of combinatorial optimization problems than the well studied traveling salesman problem, which can be formulated as a special case of SAP. The search for a good solution is considerably involved for the SAP due to a large number of equivalent solutions, and no effective heuristic has been found so far to cater to all types of circuits.  
In this paper, a matrix representation is used as the genotype for a Genetic Algorithm (GA) approach to this problem. A novel selection mechanism is introduced, and suitable genetic operators for crossover and mutation, are constructed. The properties of each of these elements of the GA are discussed and an analysis of parameters that influence the algorithm is given. A canonical form for a solution is defined to significantly reduce the search space and number of local minima.  Experiments with several examples show that the GA approach yields results that are often comparable to, or better than those obtained using established heuristics that embody extensive domain knowledge.},
	bib2html_pubtype = {Journal Articles},
	bib2html_rescat = {Evolutionary Algorithms, Optimization},
	year={1995}
}

Generated by bib2html.pl (written by Patrick Riley ) on Tue Jun 26, 2018 19:10:42