检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曾会华[1] ZENG Huihua(Guangzhou Civil Aviation College,Guangzhou 510403,China)
出 处:《通信与信息技术》2024年第4期81-85,共5页Communication & Information Technology
摘 要:针对目前装配资源受限条件下大型部件装配规划存在效率低、性能差的问题,提出一种基于离散烟花算法的装配序列规划模型。建立了装配部件、装配资源和混合干涉矩阵,以描述不同情况下的装配干涉问题。为了加快可行解的求解速度,设计了包括爆炸幅度、烟花爆炸产生的火花数量和火花位置更新的策略。实验阶段,以机翼的装配过程为例对所提模型进行验证。结果表明,与离散粒子群优化算法相比,使用所提出的离散烟花算法获得的解的适应度函数值更优,所提算法适应度值提升约24.5%。Aiming at the current problems of low efficiency and poor performance of large component assembly planning under the condition of limited assembly resources,an assembly sequence planning model based on discrete fireworks algorithm is proposed.As⁃sembly parts,assembly resources and hybrid interference matrices are established to describe the assembly interference problem in dif⁃ferent cases.In order to speed up the solving speed of the feasible solution,a strategy including the explosion amplitude,the number of sparks generated by the firework explosion and the spark position update is designed.In the experimental stage,the proposed model is validated by taking the assembly process of a wing as an example.The results show that the fitness function values of the solutions ob tained using the proposed discrete fireworks algorithm are better compared with the discrete particle swarm optimization algorithm,⁃and the fitness value of the proposed algorithm is improved by about 24.5%.
关 键 词:大型部件 装配序列 烟花算法 优化 干涉矩阵 高斯分布
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.90