| 遗传布局算法 |
| |
| 引用本文： | 刘红,韦穗.遗传布局算法[J].微机发展,2005,15(12):7-8,11. |
| |
| 作者姓名： | 刘红 韦穗 |
| |
| 作者单位： | 安徽大学计算智能与信息处理教育部重点实验室,安徽合肥230039 |
| |
| 摘 要： | VLSI门阵列模式布局是一类NP完全问题，传统的分析、研究方法和求解策略不能提供优化布局。文中将遗传算法应用于门阵列模式布局，提出了遗传布局算法，设计了相应的选择函数、交叉算子和变异算子，使布局的构形更趋合理。模拟结果表明，应用遗传布局算法能在较短的时间内提供优化解，为解决大规模、复杂的布局问题提供了广阔的前景。
|
| 关 键 词： | 遗传算法 门阵列模式布局 遗传布局 |
| 文章编号： | 1005-3751（2005）12-0007-02 |
| 收稿时间： | 2005-03-21 |
| 修稿时间： | 2005-03-21 |
Genetic Placement Algorithm |
| |
| LIU Hong,WEI Sui.Genetic Placement Algorithm[J].Microcomputer Development,2005,15(12):7-8,11. |
| |
| Authors: | LIU Hong WEI Sui |
| |
| Affiliation: | Key Lab. of Intelligent Computing and Signal Processing of Ministry of Education, Anhui Univ., Hefei 230039, China |
| |
| Abstract: | The gate array placement of very large scale integration is an NP 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 instances.Simulation result is given satisfactorily.The algorithm appears to be a promising method of solving the complex placement problems. |
| |
| Keywords: | genetic algorithm gate array placement genetic placement |
| 本文献已被 CNKI 维普 等数据库收录！ |
