Liu Hai-ming, Huang Yue-ming, Yuan Peng, G. Hong-xia, Zhang Mei
{"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}
引用次数: 2
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.