We discuss the problem of approximately sotvlng circuit layout problems by simulated annealing. For this we first summarize the theoretical concepts of the simulated annealing algorithm using Ihe theory of homogeneous and inhomogeneous Markov chains. Next we briefly review general aspects of the application ol the algorithm before we discuss in greater detail the application of the algorithm to a number of combinatorial optimizatlon problems in circuit layout, i.e. sea-of-gates placement, floorplannlng, channel routing, and compaction.
|Number of pages||27|
|Journal||Nieuw Archief voor Wiskunde (Serie IV)|
|Publication status||Published - 1991|