Application of Genetic Algorithms in the Optimization of the Drilling Path on the Printed Circuit Board

Article Preview

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

133-138

Citation:

Online since:

February 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Deo Shantanu, Javadpour R, Knapp G M. Multiple setup PCB assembly planning using genetic algorithm. Computer & Industrial Engineering, 2002, 42: 1-16.

DOI: 10.1016/s0360-8352(01)00062-6

Google Scholar

[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.

DOI: 10.1016/s0925-5273(98)00010-3

Google Scholar

[3] Wang Yingzhang, Lijian. Application of TSP improved algorithm in the NC tool path. Journal of Chongqing University, 2004, 27(12): 17-23.

Google Scholar

[4] Refael Hassin and Shlomi Rubinstein, Better approximations for max TSP. Information Processing Letters, 2000, 75(4): 181-186.

DOI: 10.1016/s0020-0190(00)00097-1

Google Scholar

[5] Cook, William; Espinoza, Daniel; Goycoolea, Marcos. Computing with domino-parity inequalities for the TSP, INFORMS Journal on Computing, 2007, 19(3): 356-365.

DOI: 10.1287/ijoc.1060.0204

Google Scholar

[6] Vickers, D.; Butavicius, M.; Lee, M.; Medvedev, A. Human performance on visually presented traveling salesman problems, Psychological Research 2001, 65(1): 34-45.

DOI: 10.1007/s004260000031

Google Scholar

[7] Guang Yu Zhu. Drilling Path Optimization Based on Swarm Intelligent Algorithm, 2006 IEEE International Conference on Robotics and Biomimetics, December 2006: 93-196.

DOI: 10.1109/robio.2006.340357

Google Scholar

[8] Kaplan, H.; Lewenstein, L.; Shafrir, N.; Sviridenko, M. Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs, In Proc. 44th IEEE Symp. on Foundations of Comput. Sci., 2004: 56–65.

DOI: 10.1109/sfcs.2003.1238181

Google Scholar