期刊文献+

基于遗传算法的两端线网布线方法

Two-terminal Net Routing Method Based on Genetic Algorithm
在线阅读 下载PDF
导出
摘要 对于给定的布线平面,基于遗传算法的两端线网布线方法首先根据障碍情况对布线平面进行网格化,然后对网格进行编号,用一系列网格序号的有序排列来表示两端点的布线路径,以多条布线路径组成的群体作为优化搜索基础,最后采用遗传算法对此群体进行遗传操作,得到两端线网的最短路径。 For a given routing plane, grid of the routing plane is performed for two-terminal net routing method based on a genetic algorithm according to the obstacle conditions, and then the grid is numbered . a group of ordered numbers are used to denote the routing paths of the terminals. and a population consisted of multiple routing paths is used as a search base. Genetic operation is conducted on the population by using the genetic algorithm, with which the shortest paths are obtained for the terminals.
作者 张红民 徐宁
出处 《江汉石油学院学报》 CSCD 北大核心 2003年第1期105-107,共3页 Journal of Jianghan Petroleum Institute
关键词 遗传算法 两端线网布线方法 网络化 最短路径 genetic algorithm routing networking shortest path
  • 相关文献

参考文献6

  • 1葛海通,严晓浪.一种有效的两端线网布线方法[J].微电子学,1999,29(1):25-29. 被引量:3
  • 2周明 孙树栋.遗传算法原理及其应用[M].北京:国防工业出版社,1996..
  • 3Yang C D, Lee D T, Wong C K. Rectilinear path problems among rectilinear obstacles revisited [J] . SIAM J. on Computing, 1995 ,24 (3) : 457~472.
  • 4Wu Y F, Widmayer P, Schlag M D F, et al. Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles [J] . IEEE Trans. On Comput. , 1987, 16 (4).- 321~331.
  • 5Yang C D, Lee D T, Wong C K. On bends and lengths of rectilinear paths: A graph-theoretic approach [J] . Intermational Journal of Computational Geometry & Applications, 1992, 2 (1): 61~74.
  • 6Gerfenstette J J. Optimization of control parameters for genetic algorithms [J]. IEEE SMC, 1986, 16 (1): 3Z~40.

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部