DocumentCode :
2325995
Title :
A genetic algorithm for channel routing using inter-cluster mutation
Author :
Rao, B. B Prahlada ; Patnaik, L.M. ; Hansdah, R.C.
Author_Institution :
Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
fYear :
1994
fDate :
27-29 Jun 1994
Firstpage :
97
Abstract :
In this paper, we propose an algorithm for the channel routing problem based on genetic approach that uses a new type of mutation, called inter-cluster mutation. The performance of genetic algorithm-based channel router is improved by incorporating problem-specific knowledge into the inter-cluster mutation operators. A solution of the channel routing problem is represented by horizontal non-constraint graph (HNCG). The clusters information in the graph of the routing solution is used in the proposed inter-cluster mutation operators. The inter-cluster mutation integrates the concept of gradient descendent method, implicitly, into the genetic algorithm based channel router. We have implemented the inter-cluster mutation operators in C, and the results of the experiment show improved performance for genetic algorithm-based channel router using inter-cluster mutation
Keywords :
circuit layout CAD; genetic algorithms; network routing; simulated annealing; VLSI circuits; channel routing; channel routing problem; genetic algorithm; genetic approach; horizontal nonconstraint graph; inter cluster mutation; interconnections; problem specific knowledge; Automation; Clustering algorithms; Computer science; Genetic algorithms; Genetic mutations; Integrated circuit interconnections; Partitioning algorithms; Routing; Simulated annealing; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on
Conference_Location :
Orlando, FL
Print_ISBN :
0-7803-1899-4
Type :
conf
DOI :
10.1109/ICEC.1994.350034
Filename :
350034
Link To Document :
بازگشت