摘要
针对贴片机喂料器的分配问题,给出一个新的模型,在贴装顺序已知的前提下,以贴装整块电路板所花费的总时间作为优化目标.基于该模型给出一种遗传算法,以目标函数作为其评价函数.与贪婪分配算法相比较,所花费的代价平均减少了6.2%,从而验证了该方法的有效性.
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.
出处
《控制与决策》
EI
CSCD
北大核心
2005年第8期955-957,960,共4页
Control and Decision
基金
国家自然科学基金项目(60474051)
上海市科技局重点攻关项目(04DZ11008)
关键词
表面贴装技术
遗传算法
系统优化
Surface mount technology Genetic algorithm System optimization
