PCB数控钻孔最佳走刀路线的建模与求解

MODELING AND SOLVING OPTIMAL MOVING PATH FOR PCB

当前的印刷电路板(PCB)数控钻自动编程系统生成的钻孔路线并非最佳走刀路线。本文通过分析,将PCB数控钻孔最佳走刀路线问题归结为大型TSP问题,其目标函数定为钻头的总走刀时间最短。由于TSP问题在理论上属于NP完备问题,很难用一般的算法求解。本文详细介绍了用模拟退火方法求解该问题的具体算法,并以此为基础开发了PCB最优化的自动编程系统。

Up to now, the drilling path of automatic generation by programming system for printed circuit boards(PCB)is still not optimal moving path. On the basis of analysis, the problem of optimal 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 in theory,it is too difficult to be solved with traditional optimal methods.In this paper,the concrete scheme of solving TSP for PCB by simulated annealing algorithms is discussed in detail. Based on the research, an optimal automatic programming system for PCB is developed.