A simulated annealing channel routing algorithm (Q1179437)

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.