A simulated annealing channel routing algorithm (Q1179437)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 24627
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simulated annealing channel routing algorithm |
scientific article; zbMATH DE number 24627 |
Statements
A simulated annealing channel routing algorithm (English)
0 references
26 June 1992
0 references
In this paper an algorithm for the channel routing problem on the Manhattan model for CAD-VLSI is proposed. One important feature of this algorithm is the employment of the simulated annealing method for searching an optimal solution. Although a simulated annealing algorithm can require very long execution times, in the case handled in this paper, the algorithm is normally to be executed off-line and rather infrequently, thus the achievement of a good solution is much more important than the computational time.
0 references
channel routing
0 references
CAD-VLSI
0 references
simulated annealing
0 references
0.7945064306259155
0 references
0.7925519943237305
0 references
