| 双层PCB布线的混合蚂蚁优化方法 |
| |
| 引用本文： | 王周缅,马良.双层PCB布线的混合蚂蚁优化方法[J].安徽大学学报(自然科学版),2007,32(2):48-52. |
| |
| 作者姓名： | 王周缅 马良 |
| |
| 作者单位： | 上海理工大学,管理学院,上海,200093;武警上海政治学院,上海,200435;上海理工大学,管理学院,上海,200093 |
| |
| 基金项目： | 国家自然科学基金资助项目(70471065)，上海市重点学科建设基金资助项目(T0502) |
| |
| 摘 要： | 蚂蚁算法是一种新型的进化算法,已证明其对TSP问题有很好的解决能力.笔者将一种混合蚂蚁算法应用于PCB布线问题,以路径最短为目标,辅以分布布线、避障规则等手段求出最短路径,在线网的拓扑结构已确定之后,运用元胞自动机的元胞演化机理,以通孔最小化为目标,对线网进行层分配.最后在计算机上用Delphi实现.通过对一个实际布线问题的测试,得出比Protel更好的布线结果.
|
| 关 键 词： | 混合蚂蚁算法 元胞自动机 双层PCB布线 层分配 |
| 文章编号： | 1000-2162（2007）02-0048-05 |
| 修稿时间： | 2007-01-05 |
Application of composite ant colony optimization to two-layer PCB routing |
| |
| WANG Zhou-mian,MA Ling.Application of composite ant colony optimization to two-layer PCB routing[J].Journal of Anhui University(Natural Sciences),2007,32(2):48-52. |
| |
| Authors: | WANG Zhou-mian MA Ling |
| |
| Institution: | 1. School of Management, Science and Technology University of Shanghai, Shanghai 200093, China; 2. Shanghai Polity College of Armed Police Forces, Shanghai 200435 ,China |
| |
| Abstract: | Ant algorithm has successfully solved series of difficult discrete optimization problems.In this paper,a new method for solving the PCB routing problem is proposed by using the idea of cellular automata and ant colony algorithm.Assisted route distributing,rules of obstacle avoidance are used for via and route minimization.And after the topology of route is confirmed,evolvement of cellular is used in layer distribution.This algorithm is coded in Delphi,and real world instance is solved which results within satisfaction by comparing with that of Protel99. |
| |
| Keywords: | ant algorithm cellular automata two layer PCB routing layer distribution |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
