An Algorithm for Optimizing NC Program of a Chip Shooter

Abstract

A chip shooter is a machine which mounts chip electronic components on a PCB (printed circuit board). The time of mounting all components on a PCB with a chip shooter, is influenced by in what sequence of mounting components, and in what placement of tape cassettes. Because of huge amount of permutation, it is impossible to solve this problem in brute force method. Therefor we developed an algorithm for optimizing sequence of mounting and place-ment of tape cassettes. We optimize some random data by this algorithm, and reduce the time of mountng by 13.8% at the maximum. This paper describes the algorithm and evaluation of the algorithm.