首页> 外文期刊>Procedia Manufacturing >Balanced Adaptive Tabu Search Algorithm to Optimize Dual-gantry Pick-and-place Assembly
【24h】

Balanced Adaptive Tabu Search Algorithm to Optimize Dual-gantry Pick-and-place Assembly

机译:平衡自适应禁忌搜索算法优化双甘龙镐和放置组件

获取原文

摘要

This paper presents an optimization study of dual-gantry high-speed rotary-type pick-and-place surface mount device (SMD) machine. In the dual-gantry SMD machine, there are two feeder bases and gantry heads, such that two placement heads can pick-and-place synchronously in one PCB, which has an advantage in assembly PCB with more component types. The dual-gantry optimization problem is decomposed into nozzle arrangement, feeder assignment, pick-and-place sequence, component allocation, and gantry schedule problems. To balance the workload between gantries and reduce the wait time in the gantry's synchronous movement, a balanced adaptive tabu search (BATS) algorithm is proposed. Based on the 16 industrial data tests, the proposed algorithm yields a 7.04% improvement on average compared to the industrial package.
机译:本文介绍了双龙门高速旋转型拾取器表面贴装装置(SMD)机器的优化研究。在双龙门SMD机器中,有两个进料底座和龙门杆头,使得两个放置头可以在一个PCB中同步地拾取,在组装PCB中具有更多组件类型的优势。双龙门优化问题被分解成喷嘴布置,进料器分配,拾取序列,分量分配和龙门的时间表问题。为了平衡龙门的工作量并减少龙门的同步运动中的等待时间,提出了平衡自适应禁忌搜索(蝙蝠)算法。基于16个工业数据测试,该算法与工业包装相比,平均水平提高了7.04%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号