A Hybrid algorithm for VLSI Placement Based on B*-tree

摘要：

In this paper, a hybrid algorithm for a non-slicing VLSI placement problem is presented. The hybrid algorithm defines an ordering principle and horizontal contour to construct an initial B*-tree, and combines simulated annealing algorithm and tabu search algorithm to solve the VLSI placement problem. It is an effective method to generate an initial solution and an efficient local search method to exploit information in the search region. The experimental results using MCNC benchmarks show that our approach is prior to other existing results.

关键词： ordering principle simulated annealing tabu search

作者: Jianli Chen Wenxing Zhu

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

会议类型: 国际会议

会议名称: The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)

会议地点: 长沙

会议语种:英文

页码: 327-332

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