본문 바로가기
KERD
논문KCI 등재

이형 부품 표면실장기에 대한 겐트리 경로 문제의 최적 알고리즘

Optimization Algorithm of Gantry Route Problem for Odd-type Surface Mount Device

0

조회

0

다운로드

3

인용

0

참고문헌

키워드

주제분류산업공학

초록

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.

Abstract

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.

참고문헌 (22)

  1. Ashayeri, J., "An aggregated optimization model for multi-head SMD placements", Computer & Industrial Engineering, 60(1), pp.99~105 (2011)
  2. Ayob, M., "A survey of surface mount device placement machine optimization : Machine classification", European Journal of Operational Research, 186(3), pp.893~914 (2008)
  3. "SMD Placement, in the SMT in FOCUS"[URL]
  4. Chen, T., "Component placement process optimization for multi-head surface mounting machine based on tabu search and improved shuffled frog-leaping algorithm", IEEE Intelligent Systems and Applications (ISA), pp.1~4 (2011)
  5. Du, X., "Placement process optimization of dual-gantry turret placement machine", IEEE, 2008, 1266~1271
  6. Hardas, C. S., "Develop-ment of a genetic algorithm for component placement sequence optimization in printed circuit board assem-bly", Computers & Industrial Engineering, 55(1), pp.165~182 (2008)
  7. Jeevan, "Optimization of PCB component place-ment using genetic algorithms", Journal of Electronics Manufacturing, 11(1), pp.69~79 (2002)
  8. Jiang, J., "Optimization of the surface mount technology based on the max-min ant system", 2nd International Conference on Future Computer and Communication(ICFCC), pp.45~47 (2010)
  9. 김지용, "단일 허브를 이용한 시간 제약이 존재하는수거 및 배달 차량 경로 문제", 한국산업경영시스템학회지, 42(4), pp.16~22 (2019), 한국산업경영시스템학회[DOI]
  10. Lee, S. H., "A hierarchical method to improve the productivity of a multi-head surface mounting machines", Intelligent Automation and Soft Computing, 6(4), pp.291~301 (2000)
  11. Li, S. Y., "Enhancing optimal feeder assignment of the multi-head surface mounting machine using genetic algorithms", Applied Soft Com-puting, 8(1), pp.522~529 (2008)
  12. Lin, C. -J., "Modified artificial bee col-ony algorithm for scheduling optimization for printed circuit board production", Journal of Manufacturing Systems, 44(1), pp.1~11 (2017)
  13. Loh, T. S., "A genetic algorithm for sequential part assignment for PCB assembly", Computer and Industrial Engineering, 40(4), pp.293~307 (2001)
  14. Magyar, G., "On solving single machine optimization problems in electronics assembly", Journal of Electronics Manufacturing, 9(4), pp.249~267 (1999)
  15. McGinnis, "Automated process planning for printed circuit card assembly", IIE Transactions, 24(4), pp.18~30 (1992)
  16. Moyer, L. K., "An efficient assembly sequencing heuristic for printed circuit board config-urations", Journal of Electronics Manufacturing, 7(2), pp.143~160 (1997)
  17. 손동훈, "다특성 차량경로문제에 대한 휴리스틱 알고리즘 : 국내 복합사료 업체 사례", 한국산업경영시스템학회지, 42(1), pp.8~20 (2019), 한국산업경영시스템학회[DOI]
  18. Sun, D. S., "Component allocation and feeder arrangement for a dual-gantry multi-head surface mounting placement tool", International Journal of Production Economics, 95(2), pp.245~264 (2005)
  19. Tirpak, T. M., "Design-to-manufacturing information mana-gement for electronics assembly", International Journal of Flexible Manufacturing Systems, 12, pp.189~205 (2000)
  20. Torabi, S. A., "A new opti-mization approach for nozzle selection and component allocation in multi-head beam-type SMD placement machines", Journal of Manufacturing Systems, 32(4), pp.700~714 (2013)
  21. Wilhelm, W. E., "A model to optimize placement operations on dual-head placement machines", Discrete Optimization, 4(2), pp.232~256 (2007)
  22. Zhu, G. Y., "An improved Shuffled Frog-leaping Algorithm to optimize component pick-andplace sequencing optimization problem", Expert Systems with Applications, 41(15), pp.6818~6829 (2014)

관련 논문AI추천

이 간행물의 다른 논문 (24건)