关键词: 印刷电路板, 最佳走刀路径, 旅行商问题, 遗传算法

Abstract: 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.

Key words: Printed Circuit Board（PCB）, optimal drilling path, Travel Salesman Problem（TSP）, genetic algorithm