基于差分算法的贴装顺序优化问题求解  

Mounting sequential optimization and problem-solving using differential algorithms

作　　者：朱光宇[1] 罗哲[1] 陈志锦[1] 

机构地区：[1]福州大学机械工程及自动化学院,福建福州350002

出　　处：《中国工程机械学报》2012年第4期391-397,共7页Chinese Journal of Construction Machinery

基　　金：福建省科技厅重点资助项目(2009H0025);福建省自然科学基金资助项目(2009J01246)

摘　　要：元器件取料、贴放顺序是影响印刷电路板(PCB)贴片机工作效率的关键因素之一.针对拱架型多头贴片机建立以时间为研究对象的取料、贴放顺序优化数学模型.给定解的整数编码形式,利用差分算法解决此优化问题.将迁徙操作思想引入差分算法,建立带迁徙操作的差分算法,并给出算法流程及实现方式.通过实验选择差分算法的较佳参数,用两组实验将差分算法、带迁徙操作的差分算法与遗传算法进行比较,实验表明差分算法、带迁徙操作的差分算法能够有效地解决拱架型多头贴片机元器件的取料、贴放优化问题,且优化结果较遗传算法好.The component reclaiming and placement sequence secures a crucial position in the efficiency of PCB mounting machines. With regard to the arch multi-head surface mounting machines, a time-based mathematical model is first established for sequential optimization. Based on the integer encoding and differential algorithm, the migration operation is then adapted to tackle the algorithmic process and implemental mode. By selecting the preferred parameters for differential algorithms via experiments, the comparisons are next conducted among the differential algorithm,immigration-operation-based differential algorithm and genetic algorithm. Finally, it is detected from experiments that the differential algorithm and immigration-operation-based differential algorithm, rather than the genetic algorithm, can effectively resolve the component reclaiming and placement optimization problems.

关 键 词：贴装顺序优化 差分算法 数学模型 表面贴装技术 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]