Enhanced Simulated Annealing Technique for the Single-Row Routing Problem
- 55 Downloads
This paper presents ESSR (Enhanced Simulated annealing for Single-row Routing) model for solving the single-row routing problem. The main objective in this problem is to produce a realization that minimizes both the street congestion and the number of doglegs. Simulated annealing (SA) is a stochastic, hill-climbing and gradient-descent technique based on the statistical properties of particles undergoing thermal annealing. By performing slow cooling, the nets in the single-row routing problem align themselves according to a configuration with the lowest energy. The model has been known to produce reasonably good solutions for many NP-complete optimization problems, such as the single-row routing problem. In ESSR, our strategy is to minimize both the street congestion and the number of interstreet crossings (doglegs) by expressing a single energy function as their collective properties. This objective is achieved by representing the energy as the absolute sum of the heights of the net segments. To speed up convergence, we pivot the street congestion value while having the energy drops directly proportional to the number of doglegs. This action has the effect of minimizing the number of doglegs as the energy stabilizes. Our simulation work on ESSR produces optimal results in most cases for both the street congestion and the number of doglegs. Our experimental results compare well against results obtained from our earlier model (SRR-7) and two other methods reported in the literature.
Unable to display preview. Download preview PDF.
- 1.E. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines. John Wiley, New York, 1989.Google Scholar
- 2.J. S. Deogun and N. A. Sherwani. A decomposition scheme for single-row routing problems. Technical report series #68, Dept of Computer Science, Univ. of Nebraska, 1988.Google Scholar
- 3.D. H. Du and L. H. Liu, Heuristic algorithms for single row routing. IEEE Transactions on Computers, 36(3):312-319, 1987.Google Scholar
- 4.S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598):617-678, 1983.Google Scholar
- 5.E. S. Kuh, T. Kashiwabara, and T. Fujisawa. On optimum single-row routing. IEEE Transactions on Circuits and Systems, 26(6):361-368, 1979.Google Scholar
- 6.S. Olariu and A. Y. Zomaya. A time-and cost-optimal algorithm for interlocking sets with applications. IEEE Transactions on Parallel and Distributed Systems, 7(10):1009-1025, 1996.Google Scholar
- 7.R. Raghavan and S. Sahni. Single row routing. IEEE Transactions on Computers, 32(3):209-220, 1983.Google Scholar
- 8.R. A. Rutenbar. Simulated annealing algorithms: An overview. IEEE Circuits and Devices Magazine, Jan. 19–26, 1989.Google Scholar
- 9.S. Salleh and A. Y. Zomaya. Scheduling for Parallel Computing Systems: Fuzzy and Annealing Techniques. Kluwer Academic Publishers, Boston, 1999.Google Scholar
- 10.H. C. So. Some theoretical results on the outing of multilayer printed wiring board. Proceedings of the IEEE Symposium on Circuits Systems, pp. 296-303, 1974.Google Scholar
- 11.T. T. Tarng, M. M. Sadowska, and E. S. Kuh. An efficient single-row algorithm. IEEE Transactions on Computer-Aided Design, 3(3):178-183, 1984.Google Scholar
- 12.B. S. Ting, E. S. Kuh, and L. Shirakawa. The multilayer routing problem: algorithms and necessary and sufficient conditions for the single row, single layer case. IEEE Transactions on Circuits Systems, 23:768-778, 1976.Google Scholar