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

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

Modeling and Solving Optimal Moving Path for NC Drilling of PCB

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.