DOI QR코드

DOI QR Code

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

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

  • Jeong, Jaewook (Department of Industrial Engineering, Yonsei University) ;
  • Tae, Hyunchul (Department of Smart Manufacturing Innovation Research, Korea Institute of Industrial Technology)
  • 정재욱 (연세대학교 산업공학과) ;
  • 태현철 (한국생산기술연구원 스마트제조혁신연구부문)
  • Received : 2020.09.29
  • Accepted : 2020.11.05
  • Published : 2020.12.31

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.

Keywords

References

  1. Ashayeri, J., Ma, N., and Sotirov, R., An aggregated optimization model for multi-head SMD placements, Computer & Industrial Engineering, 2011, Vol. 60, No. 1, pp. 99-105. https://doi.org/10.1016/j.cie.2010.10.004
  2. Ayob, M. and Kendall, G., A survey of surface mount device placement machine optimization : Machine classification, European Journal of Operational Research, 2008, Vol. 186, No. 3, pp. 893-914. https://doi.org/10.1016/j.ejor.2007.03.042
  3. Bentzen, B., SMD Placement, in the SMT in FOCUS, http://www.Smtinfocus.com/PDF/SMD_placement.Pdf.
  4. Chen, T., Luo, J., and Hu, Y., 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), 2011, Wuhan, China, pp. 1-4.
  5. Du, X. and Li, Z., Placement process optimization of dual-gantry turret placement machine, IEEE/ASME International Conference on Advanced Intelligent Mechatronics, 2008, Xian, China, pp. 1266-1271.
  6. Hardas, C.S., Doolen, T.L., and Jensen, D.H., Development of a genetic algorithm for component placement sequence optimization in printed circuit board assembly, Computers & Industrial Engineering, 2008, Vol. 55, No. 1, pp. 165-182. https://doi.org/10.1016/j.cie.2007.11.016
  7. Jeevan et al., Optimization of PCB component placement using genetic algorithms, Journal of Electronics Manufacturing, 2002, Vol. 11, No. 1, pp. 69-79. https://doi.org/10.1142/S0960313102000230
  8. Jiang, J., Chen, X., Zang, M., Wang, Z., and Tan, Z., Optimization of the surface mount technology based on the max-min ant system, 2nd International Conference on Future Computer and Communication(ICFCC), 2010, Wuha, China, pp. 45-47.
  9. Kim, J.Y., Pick up and delivery vehicle routing problem under time window using single hub, Journal of Society of Korea Industrial and Systems Engineering, 2019, Vol. 42, No. 4, pp. 16-22. https://doi.org/10.11627/jkise.2019.42.4.016
  10. Lee, S.H., Lee, B.H., and Park, T.H., A hierarchical method to improve the productivity of a multi-head surface mounting machines, Intelligent Automation and Soft Computing, 2000, Vol. 6, No. 4, pp. 291-301. https://doi.org/10.1080/10798587.2000.10642797
  11. Li, S.Y., Hu, C.F., and Tian, F.H., Enhancing optimal feeder assignment of the multi-head surface mounting machine using genetic algorithms, Applied Soft Computing, 2008, Vol. 8, No. 1, pp. 522-529. https://doi.org/10.1016/j.asoc.2007.02.012
  12. Lin, C.-J. and Huang, M.-L., Modified artificial bee colony algorithm for scheduling optimization for printed circuit board production, Journal of Manufacturing Systems, 2017, Vol. 44, No. 1, pp. 1-11. https://doi.org/10.1016/j.jmsy.2017.04.006
  13. Loh, T.S., Bukkapatnam, S., Medeiros, D., and Kwon, H., A genetic algorithm for sequential part assignment for PCB assembly, Computer and Industrial Engineering, 2001, Vol. 40, No. 4, pp. 293-307. https://doi.org/10.1016/S0360-8352(01)00030-4
  14. Magyar, G., Johnsson, M., and Nevalainen, O., On solving single machine optimization problems in electronics assembly, Journal of Electronics Manufacturing, 1999, Vol. 9, No. 4, pp. 249-267. https://doi.org/10.1142/S0960313199000179
  15. McGinnis et al., Automated process planning for printed circuit card assembly, IIE Transactions, 1992, Vol. 24, No. 4, pp. 18-30. https://doi.org/10.1080/07408179208964231
  16. Moyer, L.K. and Gupta, S.M., An efficient assembly sequencing heuristic for printed circuit board configurations, Journal of Electronics Manufacturing, 1997, Vol. 7, No. 2, pp. 143-160. https://doi.org/10.1142/S0960313197000154
  17. Son, D.H. and Kim, H.J., Heuristic for Rich Vehicle Routing Problem : A Case of a Korean Mixed Feed Company, Journal of Society of Korea Industrial and Systems Engineering, 2019, Vol. 42, No. 1, pp. 8-20.
  18. Sun, D.S., Lee, T.E., and Kim, K.H., Component allocation and feeder arrangement for a dual-gantry multi-head surface mounting placement tool, International Journal of Production Economics, 2005, Vol. 95, No. 2, pp. 245-264. https://doi.org/10.1016/j.ijpe.2004.01.003
  19. Tirpak, T.M., Design-to-manufacturing information management for electronics assembly, International Journal of Flexible Manufacturing Systems, 2000, Vol. 12, pp. 189-205. https://doi.org/10.1023/A:1008147730912
  20. Torabi, S.A., Hamedi, M., and Ashayeri, J., A new optimization approach for nozzle selection and component allocation in multi-head beam-type SMD placement machines, Journal of Manufacturing Systems, 2013, Vol. 32, No. 4, pp. 700-714. https://doi.org/10.1016/j.jmsy.2013.09.005
  21. Wilhelm, W.E., Choudhry, N.D., and Damodaran, P., A model to optimize placement operations on dual-head placement machines, Discrete Optimization, 2007, Vol. 4, No. 2, pp. 232-256 https://doi.org/10.1016/j.disopt.2006.11.006
  22. Zhu, G.Y. and Zhang, W.B., An improved Shuffled Frog-leaping Algorithm to optimize component pick-andplace sequencing optimization problem, Expert Systems with Applications, 2014, Vol. 41, No. 15, pp. 6818-6829. https://doi.org/10.1016/j.eswa.2014.04.038