+高级检索
首页 > 过刊浏览>2022年第45卷第9期 >51-60. DOI:10.11835/j.issn.1000-582X.2021.211
PDF HTML阅读 XML下载 导出引用 引用提醒
拱架式贴片机贴装路径优化
作者:
中图分类号:

TH166;TP18

基金项目:

工信部智能制造资助项目（Z20190221）；重庆市科学技术局资助项目（cstc2020jscx-msxmX022）。


Optimization of mounting path for arch style mounting machine
Author:
  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [19]
    • |
  • 相似文献 [10]
    • | | |
  • 文章评论
    摘要:

    贴片机工作时贴装头需在喂料器与印刷电路板之间频繁移动，缩短贴装头移动距离是提高贴装效率的重要途径。对多头拱架式贴片机贴装路径优化问题进行研究，分析贴装头沿喂料器移动取料时贴装路径变化，建立贴装头移动距离表达式。以贴装头移动距离最小为目标建立贴装路径优化模型，以贴装位置编号对取贴顺序编码，利用遗传算法对取贴顺序和取料方向进行优化。分析不同取料方式下贴装路径差异和结构特点，结果表明：双向取料与近侧取料在贴装点位置分布偏于PCB单侧较多时出现结构性差异，采用双向取料可获得比近侧取料更短的贴装路径，更利于提高贴装效率。

    Abstract:

    The mounting head needs to move frequently between the feeder and the printed circuit board when the mounting machine works. Shortening the moving distance of the mounting head is an important way to improve the mounting efficiency. Optimization of the mounting path for arch style mounting machine is studied. Variation of the mounting path that the mounting head moves along the feeder is analyzed, and the formula of moving distance is proposed. An optimization model is established with the goal of minimizing moving distance of the mounting head. The sequence of pick-and-place is coded by component mounting positions, and a genetic algorithm is used to optimize the sequence of pick-and-place as well as the moving direction of the mounting head. The differences and characteristics of the mounting path corresponding to different picking up methods is analyzed. The results show that there are significant differences between two-way and near side picking up especially when the distribution of points is more on one side of PCB. A shorter mounting path can be obtained by two-way picking up than by near side picking up. Therefor the two-way picking up is more useful to improve mounting efficiency.

    参考文献
    [1] Lin H Y, Lin C J, Huang M L. Optimization of printed circuit board component placement using an efficient hybrid genetic algorithm[J]. Applied Intelligence, 2016, 45(3):622-637.
    [2] Wang W, Nelson P C, Tirpak T M. Optimization of high-speed multistation SMT placement machines using evolutionary algorithms[J]. IEEE Transactions on Electronics Packaging Manufacturing, 2015, 22(2):137-146.
    [3] Lin W Q, Zhu G Y. A genetic optimization approach to optimize the multi-head surface mount placement machine[C]//Intelligent Robotics & Applications, First International Conference. DBLP, 2008:1003-1012.
    [4] Hardas C S, Doolen T L, Jensen D H. Development of a genetic algorithm for component placement sequence optimization in printed circuit board assembly[J]. Computers & Industrial Engineering, 2008, 55(1):165-182.
    [5] Alkaya A F, Duman E. Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly[J]. Discrete Applied Mathematics, 2015, 192:2-16.
    [6] Luo J X, Liu J Y. An MILP model and clustering heuristics for LED assembly optimisation on high-speed hybrid pick-and-place machines[J]. International Journal of Production Research, 2014, 52(4):1016-1031.
    [7] Zhu G Y, Ju X W, Zhang W B. Multi-objective sequence optimization of PCB component assembly with GA based on the discrete Fréchet distance[J]. International Journal of Production Research, 2018, 56(11):4017-4034.
    [8] García-Nájera A, Brizuela C A, Martínez-Pérez I M. An efficient genetic algorithm for setup time minimization in PCB assembly[J]. The International Journal of Advanced Manufacturing Technology, 2015, 77(5/6/7/8):973-989.
    [9] Han J, Seo Y. Mechanism to minimise the assembly time with feeder assignment for a multi-headed gantry and high-speed SMT machine[J]. International Journal of Production Research, 2017, 55(10):2930-2949.
    [10] Hsu H P. Solving feeder assignment and component sequencing problems for printed circuit board assembly using particle swarm optimization[J]. IEEE Transactions on Automation Science and Engineering, 2017, 14(2):881-893.
    [11] Guo S J, Geng F, Takahashi K, et al. A MCVRP-based model for PCB assembly optimisation on the beam-type placement machine[J]. International Journal of Production Research, 2019, 57(18):5874-5891.
    [12] Castellani M, Otri S, Pham D T. Printed circuit board assembly time minimisation using a novel bees algorithm[J]. Computers & Industrial Engineering, 2019, 133:186-194.
    [13] Gao J S, Zhu X M, Liu A B, et al. An iterated hybrid local search algorithm for pick-and-place sequence optimization[J]. Symmetry, 2018, 10(11):633.
    [14] 臧明相, 杜鑫, 李斌. 基于分层混合蛙跳的多头贴片机贴装调度算法[J]. 计算机集成制造系统, 2013, 19(11):2847-2853. Zang M X, Du X, Li B. Multi-head surface mounting machine scheduling based on layered shuffled frog-leaping algorithm[J]. Computer Integrated Manufacturing Systems, 2013, 19(11):2847-2853.(in Chinese)
    [15] Wang Z Y, Mumtaz J, Zhang L, et al. Application of an improved Spider Monkey Optimization algorithm for component assignment problem in PCB assembly[J]. Procedia CIRP, 2019, 83:266-271.
    [16] Li D B, He T, Yoon S W. Clustering-based heuristic to optimize nozzle and feeder assignments for collect-and-place assembly[J]. IEEE Transactions on Automation Science and Engineering, 2019, 16(2):755-766.
    [17] Luo J X, Liu J Y, Hu Y M. An MILP model and a hybrid evolutionary algorithm for integrated operation optimisation of multi-head surface mounting machines in PCB assembly[J]. International Journal of Production Research, 2017, 55(1):145-160.
    [18] Li D B, Yoon S W. PCB assembly optimization in a single gantry high-speed rotary-head collect-and-place machine[J]. The International Journal of Advanced Manufacturing Technology, 2017, 88(9/10/11/12):2819-2834.
    [19] 武洪恩, 王凯, 倪良月. 最小准则遗传算法求解贴片机贴装调度问题[J]. 现代制造工程, 2020(3):14-20. Wu H E, Wang K, Ni L Y. Minimal criterion genetic algorithm for multi-head surface mounting machine scheduling[J]. Modern Manufacturing Engineering, 2020(3):14-20.(in Chinese)
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

彭乾伟,曹乐,万婷婷,王浪,徐施恒,李欣怡.拱架式贴片机贴装路径优化[J].重庆大学学报,2022,45(9):51-60.

复制
分享
文章指标
  • 点击次数:407
  • 下载次数: 888
  • HTML阅读次数: 615
  • 引用次数: 0
历史
  • 收稿日期:2021-03-18
  • 在线发布日期: 2022-10-10
文章二维码
您是第11534651 位访问者
主管单位：中华人民共和国教育部
主办单位：重庆大学
地址：重庆市沙坪坝正街174号
电话：
重庆大学学报 ® 2025 版权所有