A simulated annealing channel routing algorithm

In this paper an algorithm for the Channel Routing Problem (CRP) on the Manhattan Model is proposed. The algorithm employs a search method in the solution space, known as Simulated Annealing. The channel width is reduced by breaking up thelong runs of the vertical constraint graph, associated with the problem. The dogleg strategy adopted is similar to that employed in the channel routing algorithm proposed in [1]. The results obtained by extensive simulation runs are encouraging compared with the results of other heuristics for the same problem.

[1]  Bruce E. Hajek,et al.  The time complexity of maximum matching by simulated annealing , 1988, JACM.

[2]  F. Darema,et al.  Parallel Algorithms for Chip Placement by Simulated Annealing , 1987, IBM J. Res. Dev..

[3]  Franco P. Preparata,et al.  A Heuristic for Channel Routing , 1989, FODO.

[4]  Takeshi Yoshimura,et al.  Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  Kenneth J. Supowit,et al.  Simulated Annealing Without Rejected Moves , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Hon Wai Leong,et al.  SIMULATED-ANNEALING CHANNEL ROUTER. , 1985 .

[8]  Ernest S. Kuh,et al.  VLSI circuit layout : theory and design , 1985 .

[9]  Thomas G. Szymanski.  Dogleg Channel Routing is NP-Complete , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.