摘要
将元胞自动机思想引入到蚂蚁算法中,提出一种新的进化算法——元胞蚂蚁算法,通过算法的元胞演化机制对信息素的二次分配,有效地扩大了对解空间的覆盖率.将元胞蚂蚁算法应用于PCB布线问题,以路径最短和通孔数量最少化为目标,辅以分布布线、避障规则等手段,最后用Delphi实现.通过对一个实际布线问题的测试,得出了比Protel更好的布线结果.
Ant algorithm has successfully solved a series of difficult discrete optimization problems. However, its convergence is quite limited. Cellular Ant Algorithm is a new one for optimization based on the principle of cellular automata. In this paper, a new method for solving the PCB routing problem is proposed by using the idea of cellular ant colony optimization. Assisted route distributing and the rule of obstacle avoidance are used for via and route minimization. The algorithm is coded in Delphi. A real world instance is solved and the results are within satisfaction compared with that of Protel.
出处
《北京师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2007年第2期170-174,共5页
Journal of Beijing Normal University(Natural Science)
基金
国家自然科学基金资助项目(70471065)
上海市重点学科建设资助项目(T0502)
关键词
蚂蚁算法
元胞自动机
PCB布线
UVM
cellular ant algorithm
PCB routing
unconstrained via minimization
