Skip to main content
SpringerLink
Log in

A simulated annealing channel routing algorithm

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Lodi, F. P. Preparata,A heuristic for channel routing, Proc. of Found. of Data Organaz. and Alg. Paris (1989), 155–169.

  2. S. Kirkpatrick, C. D. Gelatt Jr., M. P. Vecchi,Optimization by Simulated Annealing, Science Vol. 220 (1983), 671–680.

    Article  MathSciNet  Google Scholar 

  3. D. S. Johnson, C. R. Aragon, L. A. McGeoch, C. Schevon,Optimization by Simulated Annealing: an experimental evaluation (part I).

  4. G. H. Sasaki, B. Hajek,The time complexity of Maximum Matching by Simulated Annealing, JACM Vol. 35 (1988), 387–403.

    Article  MathSciNet  Google Scholar 

  5. H. W. Leong, D. F. Wong, C. L. Liu,A Simulated-Annealing channel router, IEEE Trans. on CAD (1985) 226–228.

  6. F. Darema, S. Kirkpatrick, V. A. Norton,Parallel algorithms for chip placement by Simulated Annealing, IBM J. Res. Develop. Vol. 31 N. 3 (1987).

  7. T. C. Hu, E. S. Kuh,Theory and Concepts of Circuit Layout: An Overview, in VLSI circuit layout: Theory and Design IEEE Press N.Y. 1985.

    Google Scholar 

  8. T. Leighton,A Survey of Problems and Results for Channel Routing, AWOC 86, Loutraky, 1986.

  9. T. Yoshimura, E. S. Kuh,Efficient Algorithms for Channel Routing, IEEE Trans. on CAD of Integrated Circuits and Systems CAD-1, (1982), 25–35.

  10. T. Szymanski,Dogleg Channel Routing is NP-Complete, IEEE Trans. on CAD, CAD-4 (1985), 31–40.

  11. B. S. Baker, S. N. Bhatt, T. Leighton,An Approximation Algorithm for Manhattan Routing, in F. P. Preparata, Ed., Advances in Computing Research, Vol. 2, JAI Press (1984), 205–229.

  12. J. M. Greene, K. J. Supowit,Simulated Annealing without rejecting moves, IEEE Trans. on Computer-Aided Design 5 (1986), 221–228.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Informations and Applications, University of Salerno, I-84081, Baronissi

    A. Rossi

Authors
  1. A. Rossi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was partially supported by C.N.R.: Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rossi, A. A simulated annealing channel routing algorithm. Calcolo 27, 279–290 (1990). https://doi.org/10.1007/BF02575798

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02575798

Keywords

Search

Navigation