节点文献

贴片机喂料器分配的优化及其遗传算法求解

Optimization of Feeder Assignment Using Genetic Algorithms in Surface Mounting Machine

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 田福厚李少远

【Author】 TIAN Fu-hou, LI Shao-yuan(Institute of Automation, Shanghai Jiaotong University, Shanghai 200030, China. )

【机构】 上海交通大学自动化研究所上海交通大学自动化研究所 上海200030上海200030

【摘要】 针对贴片机喂料器的分配问题,给出一个新的模型,在贴装顺序已知的前提下,以贴装整块电路板所花费的总时间作为优化目标.基于该模型给出一种遗传算法,以目标函数作为其评价函数.与贪婪分配算法相比较,所花费的代价平均减少了6.2%,从而验证了该方法的有效性.

【Abstract】 For the problem of feeder assignment, a new model for optimization is presented, which directly takes the total time spent to assembly the whole PCB as its objective, supposing the assembly sequence is already known. Based on this model, a genetic algorithm is developed, which directly takes the criterion function as its evaluation function. Compared with the result of the "greedy assignment" algorithm, which is commonly used in industrial settings, an average of 6.2% of the total price is saved, which validated the effectiveness of the proposed method.

【基金】 国家自然科学基金项目(60474051);上海市科技局重点攻关项目(04DZ11008)
  • 【文献出处】 控制与决策 ,Control and Decision , 编辑部邮箱 ,2005年08期
  • 【分类号】TN405
  • 【被引频次】33
  • 【下载频次】232
节点文献中: 

本文链接的文献网络图示:

本文的引文网络