摘要
装配是装备保养维护的重要环节,高效和无损地装配好拆卸维护的零件在战场上尤为重要。为了解决装配序列规划最优解问题,根据装配序列规划的特点,提出了基于人工萤火虫算法的离散SA-GSO算法。首先利用干涉矩阵对装配序列进行了可行性分析,并根据操作实际设定了适应度函数;然后针对人工萤火虫算法存在的易早熟等缺陷,利用模拟退火原理进行优化并对算法进行离散化,以适用于装配序列最优解问题;最后进行了实例验证,实验结果证明了该算法的可行性及有效性。
Assembly is an important part of equipment maintenance.Assembling efficiently and non-destructively is especially crucial at warzone.In order to solve the optimization problem of assembly sequence planning,discrete SA-GSO algorithm based on glowworm swarm optimization algorithm is proposed.First,the interference matrix is used to analyze the feasibility of assembly sequence and fitness function is designed according to the actual operation.The simulated annealing principle is used to optimize the glowworm swarm optimization algorithm to solve the defect such as premature problem.Then the algorithm is discreted to suit for solving the optimization problem of ASP.The example shows the feasibility and effectiveness of the proposed algorithm.
出处
《测控技术》
CSCD
2016年第3期140-144,共5页
Measurement & Control Technology
关键词
装配序列规划
人工萤火虫算法
模拟退火
离散化
assembly sequence planning
glowworm swarm optimization algorithm
simulated annealing
discretization