Load Optimization Scheduling of Chip Mounter Based on Hybrid Adaptive Optimization Algorithm

Xuesong Yan;Hao Zuo;Chengyu Hu;Wenyin Gong;Victor S. Sheng
{"title":"Load Optimization Scheduling of Chip Mounter Based on Hybrid Adaptive Optimization Algorithm","authors":"Xuesong Yan;Hao Zuo;Chengyu Hu;Wenyin Gong;Victor S. Sheng","doi":"10.23919/CSMS.2022.0026","DOIUrl":null,"url":null,"abstract":"A chip mounter is the core equipment in the production line of the surface-mount technology, which is responsible for finishing the mount operation. It is the most complex and time-consuming stage in the production process. Therefore, it is of great significance to optimize the load balance and mounting efficiency of the chip mounter and improve the mounting efficiency of the production line. In this study, according to the specific type of chip mounter in the actual production line of a company, a maximum and minimum model is established to minimize the maximum cycle time of the chip mounter in the production line. The production efficiency of the production line can be improved by optimizing the workload scheduling of each chip mounter. On this basis, a hybrid adaptive optimization algorithm is proposed to solve the load scheduling problem of the mounter. The hybrid algorithm is a hybrid of an adaptive genetic algorithm and the improved ant colony algorithm. It combines the advantages of the two algorithms and improves their global search ability and convergence speed. The experimental results show that the proposed hybrid optimization algorithm has a good optimization effect and convergence in the load scheduling problem of chip mounters.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/9420428/10065394/10065396.pdf","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"复杂系统建模与仿真(英文)","FirstCategoryId":"1089","ListUrlMain":"https://ieeexplore.ieee.org/document/10065396/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A chip mounter is the core equipment in the production line of the surface-mount technology, which is responsible for finishing the mount operation. It is the most complex and time-consuming stage in the production process. Therefore, it is of great significance to optimize the load balance and mounting efficiency of the chip mounter and improve the mounting efficiency of the production line. In this study, according to the specific type of chip mounter in the actual production line of a company, a maximum and minimum model is established to minimize the maximum cycle time of the chip mounter in the production line. The production efficiency of the production line can be improved by optimizing the workload scheduling of each chip mounter. On this basis, a hybrid adaptive optimization algorithm is proposed to solve the load scheduling problem of the mounter. The hybrid algorithm is a hybrid of an adaptive genetic algorithm and the improved ant colony algorithm. It combines the advantages of the two algorithms and improves their global search ability and convergence speed. The experimental results show that the proposed hybrid optimization algorithm has a good optimization effect and convergence in the load scheduling problem of chip mounters.
基于混合自适应优化算法的贴片机负载优化调度
贴片机是表面贴装技术生产线上的核心设备,负责完成贴装作业。这是生产过程中最复杂、最耗时的阶段。因此,优化贴片机的负载平衡和贴片效率,提高生产线的贴片效率具有重要意义。在本研究中,根据某公司实际生产线中贴片机的具体类型,建立了最大值和最小值模型,以最小化贴片机在生产线中的最大周期时间。通过优化各贴片机的工作调度,可以提高生产线的生产效率。在此基础上,提出了一种混合自适应优化算法来解决贴片机的负载调度问题。混合算法是自适应遗传算法和改进蚁群算法的混合。它结合了两种算法的优点,提高了两种算法的全局搜索能力和收敛速度。实验结果表明,所提出的混合优化算法在贴片机负载调度问题中具有良好的优化效果和收敛性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.80
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信