DocumentCode
3440294
Title
Monreale: a new genetic algorithm for the solution of the channel routing problem
Author
Buttitta, Benedetto ; Orlando, Paolo ; Sorbello, Filippo ; Vassallo, Giorgio
Author_Institution
CRES Centro per la Ricerca Elettronica in Sicilia, Palermo, Italy
fYear
1991
fDate
13-16 May 1991
Firstpage
462
Lastpage
466
Abstract
A novel channel router algorithm (Monreale) is implemented which is based on a modified genetic algorithm (GA). The distinctive feature of the algorithm is a well balanced combination of the fast performance characterizing the steepest descent method and of the high level of parallelism and of local minimum trapping avoidance characterizing the GA approach. The Monreale approach, like the traditional GA approach, starts out with a simulation of population evolution of individuals subject to a well defined two set of rules in the presence of rules violations
Keywords
VLSI; circuit layout CAD; genetic algorithms; minimisation; Monreale; channel router algorithm; genetic algorithm; local minimum trapping avoidance; parallelism; population evolution; rules violations; simulation; steepest descent; Area measurement; Design optimization; Genetic algorithms; Genetic mutations; Nonhomogeneous media; Pins; Polynomials; Q factor; Routing; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
CompEuro '91. Advanced Computer Technology, Reliable Systems and Applications. 5th Annual European Computer Conference. Proceedings.
Conference_Location
Bologna
Print_ISBN
0-8186-2141-9
Type
conf
DOI
10.1109/CMPEUR.1991.257430
Filename
257430
Link To Document