Journal of Institute of Control, Robotics and Systems (제어로봇시스템학회논문지)

Institute of Control, Robotics and Systems (제어로봇시스템학회)
권호 표지

A Path Planning Algorithm for Dispenser Machines in Printed Circuit Board Assembly System

인쇄회로기판 조립용 디스펜서의 경로계획 알고리즘

  • Published : 2000.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper proposes a path planning algorithm for dispensers to increase the productivity in printed circuit board assembly lines. We analyze the assembly sequence of the dispenser, and formulate it as an integer programming problem. The mathematical formulation can accomodate multiple heads and different types of heads through extended cost matrix. The TSP algorithms are then applied to the formulated problem to find the near-optimal solution. Simulation results are presented to verify the usefulness of the proposed scheme.

Keywords

References

  1. T. L. Landers et. al., Electronic Manufacturing Processes, Prentice-Hall, 1994
  2. Samsung Surface Mount System, 삼성항공산업(주), 1999
  3. PCB Assembly system, Yamaha Motors Co. Ltd., 1998
  4. SMT System, LG 산전(주), 1998
  5. Michael O. Ball, 'Sequencing of insertions in printed circuit board assembly,' Operations Research, vol. 36, no. 2, pp. 192-201, 1988
  6. R. Kumar and H. Li, 'Integer programming approach to printed circuit board assembly time optimization', IEEE Trans. on Components, Packaging and Manufacturing Technology, Part-E: Advanced Packaging, vol. 18, no. 4, pp. 720-727,1995 https://doi.org/10.1109/96.475281
  7. W. Wang, P. C. Nelson and T. M. Tirpak, 'Optimization of high-speed multistation SMT placement machines using evolutionary algorithms', lEEE, Trans. On Electronics Packaging Manufacturing, vol. 22, no. 2, April, 1999 https://doi.org/10.1109/6104.778173
  8. S. H. Lee, B. H. Lee, and T. H. Park, 'A hierarchical method to improve the productivity of a multi-head surface mounting machine', Proc. of the 1999 IEEE Int. Conf. on Robotics and Automation, pp. 2110-2115, 1999 https://doi.org/10.1109/ROBOT.1999.770418
  9. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization Algorithms and Complexity, Prentice- Hall Inc., 1982
  10. R. K. Ahuja, T, L, Magnanti, and J. B. Orlin, Network Flows : Theory, Algorithms, and Applications, Prentice-Hall Inc., 1993
  11. M. Bellmore and G. Nemhauser, 'The traveling-salesrnan problem: a survey,' Operation Research, vol. 16, pp. 538-558, 1968
  12. B. Golden, L. Bodin, T. Doyle, and W. Stewart , 'Approximate traveling salesman algorithms,' Operation Research, vol. 28, no. 3, pp. 694-711, 1980
  13. R. L. Karg and G. L. Thompson, 'A heuristic approach to solving traveling salesman Problems', Management Science, vol. 10, no. 2, pp.225-248, 1964
  14. S. Lin, 'Computer solutions of the traveling-salesman problem', Bell System Technical Journal, vol. 44, pp. 2245-2269, 1965
  15. S. Lin, and B. W. Kernighan, 'An effective heuristic for the TSP,' Operation Research, vol. 21, pp. 498-516, 1973
  16. B. Gavish, 'An optimal solution method for large-scale multiple traveling salesman problems,' Operation Research, vol. 34, no. 5, pp. 698-717, 1986