摘要
目前,采用PCB数控钻孔自动编程系统获得的走刀路径并非最佳路径。论文将最佳走刀路径归结为TSP问题,将目标函数定位钻头走刀时间最短。详尽介绍了应用遗传算法解决该问题的具体算法。并通过实验讨论了变异算子和变异概率对优化结果的影响。
Currently,the drilling path by default generated by the PCB NC-drilling automatic programming system is not the optimal path.In this paper,the issue of optimal drilling path is regarded as TSP（Travel Salesman Problem ）.The objective function is set for the minimum moving time of the spindle.And this paper also includes more details about introducing GA （Genetic Algorithm） as the method to solve the PCB NC-drilling path optimization issue.Furthermore,we discuss the effect of both method and rate of the mutation on the result of optimizing algorithm through experiments.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第25期229-232,共4页
Computer Engineering and Applications
基金
广东省教育部产学研结合项目No.2007A090302108~~
关键词
印刷电路板
最佳走刀路径
旅行商问题
遗传算法
Printed Circuit Board（PCB）
optimal drilling path
Travel Salesman Problem（TSP）
genetic algorithm
