A Hybrid Genetic Algorithm for VLSI Floorplanning

摘要：

Floorplanning is the first stage of the very large scale integrated-circuit (VLSI) physical design process, the resultant quality of this stage is very important for successive design stages. From the computational point of view, VLSI floorplanning is an NP-hard problem. In this paper, a hybrid genetic algorithm (HGA) for a non-slicing and hardmodule VLSI floorplanning problem is presented. This HGA uses an effective genetic search method to explore the search space and an efficient local search method to exploit information in the search region. Experimental results on MCNC

关键词： VLSI floorplanning genetic algoritm local search B*-tree

作者: Jianli Chen Wenxing Zhu

作者单位: Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University Fuzhou 350002, China

会议类型: 国际会议

会议名称: 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

会议地点: 厦门

会议语种:英文

页码: 128-132

在线出版日期: 2010-10-29（万方平台首次上网日期，不代表论文的发表时间）