Affiliation:
1. Chongqing University of Science and Technology
2. Panzhihua Univerisity
Abstract
Efficient production of PCB is the electronic industry’s needs, while drilling is an important part in the printed circuit board manufacturing process. The drilling path optimization is crucial for improving the efficiency. Inspired by the shortest path algorithm, this paper used genetic algorithm for solving the shortest to optimal path selection of PCB drilling process and find the best path according to the specific circumstances of PCB drilling to achieve high efficiency drilling. The algorithm which has been used in the different points for practice is proved to be reasonable and efficient. The method can be optimized for fast global search, greatly reducing the computation, it is robust, efficient, can be a good solution for PCB drilling path optimization problem.
Publisher
Trans Tech Publications, Ltd.
Reference8 articles.
1. Deo Shantanu, Javadpour R, Knapp G M. Multiple setup PCB assembly planning using genetic algorithm. Computer & Industrial Engineering, 2002, 42: 1-16.
2. Khoo L P, Ng T K. A genetic algorithm-based planning system for PCB computer placement . Int. J Production Economics, 1998, 54: 321-332.
3. Wang Yingzhang, Lijian. Application of TSP improved algorithm in the NC tool path. Journal of Chongqing University, 2004, 27(12): 17-23.
4. Refael Hassin and Shlomi Rubinstein, Better approximations for max TSP. Information Processing Letters, 2000, 75(4): 181-186.
5. Cook, William; Espinoza, Daniel; Goycoolea, Marcos. Computing with domino-parity inequalities for the TSP, INFORMS Journal on Computing, 2007, 19(3): 356-365.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献