Enhanced simulated annealing technique for the single-row routing problem

• Main Authors: Salleh, Shaharuddin, Sanugi, Bahrom, Jamaluddin, Hishamuddin, Olariu, Stephan, Zomaya, Albert Y.
• Format: Article
• Language: English
• Published: Springer Netherlands 2002
• Subjects: QA75 Electronic computers. Computer science; QA Mathematics
• Online Access: http://eprints.utm.my/id/eprint/88/1/Langkah_Input_Sampel_ArtikelJurnal.pdf; http://eprints.utm.my/id/eprint/88/; http://dx.doi.org/10.1023/A:1014160411818

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.