多头贴片机的启发式优化算法

Liu Hai-ming, Huang Yue-ming, Yuan Peng, G. Hong-xia, Zhang Mei
{"title":"多头贴片机的启发式优化算法","authors":"Liu Hai-ming, Huang Yue-ming, Yuan Peng, G. Hong-xia, Zhang Mei","doi":"10.1109/ISIC.2007.4450915","DOIUrl":null,"url":null,"abstract":"This paper analyzes optimization algorithms of assembly time for a multi-head mounter. A step-by-step heuristic optimization algorithm is proposed to minimize the PCB assembly time for a multi-head mounter. By relaxing the restrictions on the problem and employing a flexible approach for feeder and head assignment, the algorithm reduces the assembly time by minimizing cycles of pick and placement, constructing the simultaneous pickup and implementing the nearest placement. The production results show that the proposed algorithm has good performance in practice.","PeriodicalId":184867,"journal":{"name":"2007 IEEE 22nd International Symposium on Intelligent Control","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Heuristic Optimization Algorithm for Multi-head Mounter\",\"authors\":\"Liu Hai-ming, Huang Yue-ming, Yuan Peng, G. Hong-xia, Zhang Mei\",\"doi\":\"10.1109/ISIC.2007.4450915\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper analyzes optimization algorithms of assembly time for a multi-head mounter. A step-by-step heuristic optimization algorithm is proposed to minimize the PCB assembly time for a multi-head mounter. By relaxing the restrictions on the problem and employing a flexible approach for feeder and head assignment, the algorithm reduces the assembly time by minimizing cycles of pick and placement, constructing the simultaneous pickup and implementing the nearest placement. The production results show that the proposed algorithm has good performance in practice.\",\"PeriodicalId\":184867,\"journal\":{\"name\":\"2007 IEEE 22nd International Symposium on Intelligent Control\",\"volume\":\"94 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE 22nd International Symposium on Intelligent Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIC.2007.4450915\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE 22nd International Symposium on Intelligent Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIC.2007.4450915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

分析了多头贴片机装配时间的优化算法。提出了一种分步启发式优化算法,以最大限度地减少多头贴片机的PCB组装时间。通过放宽对问题的限制,采用灵活的馈线和机头分配方法,该算法通过最小化拾取和放置周期,构建同时拾取和实现最近放置来减少装配时间。生产结果表明,该算法在实际应用中具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Heuristic Optimization Algorithm for Multi-head Mounter
This paper analyzes optimization algorithms of assembly time for a multi-head mounter. A step-by-step heuristic optimization algorithm is proposed to minimize the PCB assembly time for a multi-head mounter. By relaxing the restrictions on the problem and employing a flexible approach for feeder and head assignment, the algorithm reduces the assembly time by minimizing cycles of pick and placement, constructing the simultaneous pickup and implementing the nearest placement. The production results show that the proposed algorithm has good performance in practice.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信