An orthogonal simulated annealing algorithm for large floorplanning problems

Shinn-Ying Ho*, Shinn Jang Ho, Yi Kuang Lin, William Cheng Chung Chu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

30 Scopus citations


The conventional simulated annealing with some random generation mechanism using the sequence-pair topological representation in block placement and floorplanning is effective for a very small number of modules (40-50). This paper proposes an orthogonal simulated annealing algorithm (OSA) with an efficient generation mechanism (EGM) for solving large floorplanning problems. EGM samples a small number of representative floorplans and then efficiently derives a high-performance floorplan by using a systematic reasoning method for the next move of OSA based on orthogonal experimental design. Furthermore, an improved swap operation is proposed which cooperates with EGM to make OSA efficient. Excellent experimental results using the Microelectronics Center of North Carolina and the Gigascale Sysems Research Center benchmarks show that OSA performs better than existing methods for large floorplanning problems.

Original languageEnglish
Pages (from-to)874-876
Number of pages3
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Issue number8
StatePublished - 1 Aug 2004


  • Floorplanning
  • Optimization
  • Orthogonal experimental design
  • Simulated annealing
  • Very large scale integration (VLSI)

Fingerprint Dive into the research topics of 'An orthogonal simulated annealing algorithm for large floorplanning problems'. Together they form a unique fingerprint.

Cite this