粒子群算法在装配顺序规划中的应用  

A particle swarm algorithm for assembly sequence planning

作　　者：邢彦锋[1] 赵晓昱[1] 

机构地区：[1]上海工程技术大学汽车工程学院,上海201620

出　　处：《机械设计与制造》2011年第3期80-82,共3页Machinery Design & Manufacture

基　　金：上海高校知识创新工程(085)建设项目资助(JZ0901);上海市高校选拔培养优秀青年教师科研专项基金(gjd09015)

摘　　要：装配顺序规划是计算机辅助工艺设计的一个重要环节,影响着轿车车身的装配质量和效率。针对当前装配顺序规划易产生组合爆炸等问题,提出了基于粒子群算法的装配顺序规划算法。装配偏差是影响装配质量的重要因素,因此应用装配体的装配偏差评价装配顺序。在装配顺序规划过程中,首先将装配顺序编码为粒子,根据所建立的判断规则进行识别粒子的可行性,并通过装配偏差评估可行粒子的适应度值,然后根据粒子群算法过程规划装配顺序,最后采用前翼子板案例阐述装配顺序的生成和优化过程。Assembly Sequence Planning（ASP）,which influences auto-body assembly quality and efficiency,plays a key role in Computer Aided Process Planning（CAPP）.A particle swarm algorithm is proposed to generate optimal assembly sequences for compliant assemblies.Being important to assembly quality,assembly variation is used to evaluate assembly sequences.In the process of assembly sequence planning,firstly,an assembly sequence is represented by a character string,whose length equals to the number of all parts.Secondly,an assembly sequence is assigned check rules,which judge the feasibility of the particle.Then the fitness value of the feasible particle is evaluated by the assembly variation.The flowchart of PSO is used to generate and optimize assembly sequences.Finally a fender assembly is used to illustrate the algorithm of assembly sequence generation and optimization.

关 键 词：装配顺序 粒子群算法 优化 

分 类 号：TH16[机械工程—机械制造及自动化] TP391[自动化与计算机技术—计算机应用技术]