상세검색
최근 검색어 전체 삭제
다국어입력
즐겨찾기0
KCI등재 학술저널

# 이형 부품 표면실장기에 대한 겐트리 경로 문제의 최적 알고리즘Optimization Algorithm of Gantry Route Problem for Odd-type Surface Mount Device

• 등재여부 : KCI등재
• 2020.12
• 67 - 75 (9 pages)
※해당 콘텐츠는 기관과의 협약에 따라 현재 이용하실 수 없습니다.

This paper proposes a methodology for gantry route optimization in order to maximize the productivity of a odd-type surface mount device (SMD). A odd-type SMD is a machine that uses a gantry to mount electronic components on the placement point of a printed circuit board (PCB). The gantry needs a nozzle to move its electronic components. There is a suitability between the nozzle and the electronic component, and the mounting speed varies depending on the suitability. When it is difficult for the nozzle to adsorb electronic components, nozzle exchange is performed, and nozzle exchange takes a certain amount of time. The gantry route optimization problem is divided into the mounting order on PCB and the allocation of nozzles and electronic components to the gantry. Nozzle and electronic component allocation minimized the time incurred by nozzle exchange and nozzle-to-electronic component compatibility by using an mixed integer programming method. Sequence of mounting points on PCB minimizes travel time by using the branch-and-price method. Experimental data was made by randomly picking the location of the mounting point on a PCB of 800mm in width and 800mm in length. The number of mounting points is divided into 25, 50, 75, and 100, and experiments are conducted according to the number of types of electronic components, number of nozzle types, and suitability between nozzles and electronic components, respectively. Because the experimental data are random, the calculation time is not constant, but it is confirmed that the gantry route is found within a reasonable time.

1. 서 론

2. 문제 설명

3. 실험 결과

4. 결 론

References

로딩중