基于关联函数的复杂产品装配序列规划方法

Assembly sequence planning based on correlation function for complex product

针对复杂产品装配序列规划时出现组合爆炸的问题,将粒子群算法应用于求解复杂产品装配序列规划。基于可拓集合理论中关联函数的概念,提出了一种装配关联函数,由此结合各种联接关系的装配难易度构建装配联接函数。以发光二极管分拣机电极模块为例,说明了装配联接函数的计算方法。将装配联接函数、产品装配可行性和装配稳定性作为评价标准,构造装配序列规划的多目标模型。应用该方法,采用整数编码方式,对发光二极管分拣机进行了装配序列规划,并将粒子群算法与遗传算法进行对比分析,结果显示了粒子群算法的优越性。

To solve the combinatorial explosion problem in Assembly Sequence Planning（ASP） of complex product,Particle Swarm Optimization（PSO） algorithm was applied.Based on the correlation function in extension set theory,an assembly correlation function was proposed to construct assembly connection function combined with various difficult or easy degree of assembly.The electrode module of Light Emitting Diode（LED） sorting machine was taking as the example to show the correlation function＇s calculation method.Then,taking assembly connection function,assembly feasibility and assembly stability as the evaluation standards,the multi-objective planning model was set up.By using this method,the ASP of LED sorting machine was conducted by integer coding.Comparision between PSO and Genetic Algorithm（GA） was provided,and results demonstrated the superiority of PSO algorithm.