A New Algorithm for Floorplan Design
Martin D. F. Wong, C. L. Liu · Proceedings - ACM IEEE Design Automation Conference · 1986
We present in this paper a new algorithm for floorplan design using the method of simulated annealing. The major contributions of the paper are: 1. A new representation of floorplans (normalized Polish expressions) which enables us to carry out the neighborhood search effectively. 2. A simultaneous minimization of area and total interconnection length in the final solution. Experimental results indicate that the algorithm performs well in many test problems.
Cited by 369 works. doi:10.1109/dac.1986.1586075
Authors
References
- Optimization by Simulated Annealing
- The Design and Analysis of Computer Algorithms
- The TimberWolf placement and routing package
- Optimal orientations of cells in slicing floorplan designs
- A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation
- Efficient floorplan optimization
- The Planar Package Planner for System Designers
- SIMULATED-ANNEALING CHANNEL ROUTER.
- Automatic floorplan design
- On finding most optimal rectangular package plans