Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (9): 226-229.
• 工程与应用 • Previous Articles Next Articles
HE Min1, ZHOU Yonghua2, TANG Pingjiang2, BAO Weiqiang2
Received:
Revised:
Online:
Published:
何 敏1,周永华2,唐平江2,鲍伟强2
Abstract: In view of the application of Ant Colony Optimization in PCB routing, this paper proposes the improved program. It discovers the longest branch way in the closed cycle of Ant Colony Optimization algorithm, uses a total length of closed cycle minus this path to obtain the total length of the non-closed best route, and to storage optimization path, and uses the way of exploring line to complete the evolvement from the non-closed routing to the bifurcate. The experiment and the simulation result indicates this new algorithm has certain validity.
Key words: Ant Colony Optimization, best route, non-closed route, Printed Circuit Board(PCB) routing
摘要: 针对蚁群算法在PCB布线上的应用提出改进方案,找出蚁群优化算法闭合环路中最长支路路径,用闭合环路总长度减去这条路径得到非闭合环路最优路径的总长度,对寻优路径重新存储,用探索线段的方式完成从非闭合路径布线到开叉型非闭合路径布线的衍化。实验与仿真结果表明这种新的算法具有一定的有效性。
关键词: 蚁群优化算法, 最优路径, 非闭合路径, 印刷电路板(PCB)布线
HE Min1, ZHOU Yonghua2, TANG Pingjiang2, BAO Weiqiang2. Method of PCB routing based on Ant Colony Optimization[J]. Computer Engineering and Applications, 2012, 48(9): 226-229.
何 敏1,周永华2,唐平江2,鲍伟强2. 基于蚁群算法的PCB布线优化[J]. 计算机工程与应用, 2012, 48(9): 226-229.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2012/V48/I9/226