摘要
提出一种免疫算法来优化带多头的拱架式贴片机贴装过程。通过设计合理的问题编码、免疫算子以及参数,对贴装过程进行优化求解,并与遗传算法进行比较。以4贴片头的贴片机为例,对13个案例进行计算,得到免疫算法解的质量均要比遗传算法提高5%~10%,且每个实例的平均计算时间减少10%~25%。结果表明免疫算法比遗传算法更加有效。
An immune algorithm （IA） is proposed to optimize the component placement process of the arch placement ma- chine. The reasonable coding, immune operator and parameter are designed to solve the component placement process optimally. The IA is compared with the genetic algorithm（GA）. The 13 instances were calculated by taking the four-head placement ma- chine as an example. The solution quality of IA is increased by 5%~10% than that of GA, and each instance＇s average computa- tional time of IA is decreased by 10%-25% than that of GA. The results show that the IA is effective than GA.
出处
《现代电子技术》
北大核心
2017年第7期100-104,108,共6页
Modern Electronics Technique
基金
国家自然科学基金资助项目(71501064)
湖北省自然科学基金资助项目(2014CFB640)
湖北文理学院博士科研基金资助项目
关键词
贴片机
贴装过程
免疫算法
遗传算法
surface mounting machine
placement process
immune algorithm
genetic algorithm
