摘要
目前 ,采用 PCB数控钻自动编程系统生成的钻孔路线并非最佳走刀路线 .通过分析 ,将 PCB数控钻孔最佳走刀路线问题归结为大型 TSP问题 ,其目标函数定为钻头的总走刀时间最短 .由于 TSP问题在理论上属于 NP完备问题 ,因此很难用一般的算法求解 .文中详细介绍了用模拟退火方法求解该问题的具体算法 ,并以此为基础开发了
Up to now, the generation of drilling path by automatic programming system for printed circuit boards (PCB) did not give optimal solution. The problem of optimizing the moving path of NC drilling for PCB can be formulated as a large scale travelling salesman problem (TSP), and the goal function is defined as the shortest total time of moving drill. Because TSP is known to be a NP\|complete problem, it would be too difficult to tackle it with traditional optimization methods. In this paper, an algorithm of solving TSP for PCB by simulated annealing is presented in detail. Based on the research, an optimal automatic programming system for PCB is developed.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
2001年第7期590-593,共4页
Journal of Computer-Aided Design & Computer Graphics
