PCB 삽입 경로 및 부품함 위치 배정 연구

Abstract

In this paper, we try to raise the efficiency of PCB production by improving automated inserting process. This process is composed of part inserting sequence and feeder allocation problem. Until now, this problem is formulated by Traveling Salesman Problem (TSP) or Rural Postman Problem. They concentrated more on parts (chips) inserting. But in this paper, we concentrate in Feeder. We formulate 0-1 Integer program (MP2) easier than TSP. This program can be solved by using LP Package (i.e. LINDO, GAMS etc). We propose Heuristic algorithm ISFA which guarantees a local optimum and often gives optimal solution. We give some examples to prove ISFA algorithm.