首页 | 本学科首页   官方微博 | 高级检索  
     

PCB贴装中供料器分配问题的动态规划改进算法
引用本文:江松根,王石刚,姜凤鹏. PCB贴装中供料器分配问题的动态规划改进算法[J]. 计算机测量与控制, 2008, 16(9): 1310-1311
作者姓名:江松根  王石刚  姜凤鹏
作者单位:上海交通大学,机械与动力工程学院,上海,200240;上海交通大学,机械与动力工程学院,上海,200240;上海交通大学,机械与动力工程学院,上海,200240
摘    要:供料器分配问题是贴片机工艺优化问题中的一个关键问题,直接影响PCB贴装效率的高低;针对多头拱架型贴片机,首先根据取贴循环数,把问题分解为相互联系的子问题,然后针对每个取贴循环分别建立动态规划模型,并为了提高多阶段决策动态规划问题的搜索效率,提出了一种动态规划改进算法;当所有的子问题都获得解决后,整个供料器分配问题就获得解决;实验证明,所提算法能有效提高贴片机贴片效率,减少贴片时间。

关 键 词:贴片机  供料器分配  动态规划  改进算法

Dynamic Programming Refinement Algorithm for Feeder Assignment Problem of PCB Operation Optimization
Jiang Songgen,Wang Shigang,Jiang Fengpeng. Dynamic Programming Refinement Algorithm for Feeder Assignment Problem of PCB Operation Optimization[J]. Computer Measurement & Control, 2008, 16(9): 1310-1311
Authors:Jiang Songgen  Wang Shigang  Jiang Fengpeng
Affiliation:(School of Mechanical Engineering,Shanghai Jiao Tong University,Shanghai 200240,China)
Abstract:Feeder assignment problem is a critical problem of mounting machine operation optimization problems which directly affect the efficiency of mounting PCB.The problem is decomposed into some related subproblems according to the number of pick-and-place cycles.And then,a dynamic programming model for each pick-and-place cycle is established,and a dynamic programming refinement algorithm is introduced to improve the search efficiency.When all the subproblems have been solved successfully,the Feeder assignment is solved.The experiment results are presented to show that this algorithm can solve the problem effectively.
Keywords:mounter  feeder assignment  dynamic programming  refinement algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号