遗传布局算法

Genetic Placement Algorithm

VLSI门阵列模式布局是一类NP完全问题,传统的分析、研究方法和求解策略不能提供优化布局。文中将遗传算法应用于门阵列模式布局,提出了遗传布局算法,设计了相应的选择函数、交叉算子和变异算子,使布局的构形更趋合理。模拟结果表明,应用遗传布局算法能在较短的时间内提供优化解,为解决大规模、复杂的布局问题提供了广阔的前景。

The gate array placement of very large scale integration is an NIP complete problem, traditional analysis and research methods can＇t give optimized result. This paper presents a genetic placement algorithm for the gate array placement. The corresponding select, crossover operator and mutation operator are designed to generate a new configuration. The algorithm has been run on test instance. Simulation result is given satisfactorily. The algorithm appears to be a promising method of solving the complex placement problen-ts.