摘要
对帝国竞争算法进行了研究与改进以解决虚拟装配过程中装配序列规划问题。利用有向图法获得了表达装配关系的邻接矩阵、干涉矩阵、接触-连接矩阵、优先关系矩阵、工具集矩阵,建立了以装配稳定性、连续性及干涉性为评价标准的稳定性函数、连续性函数及干涉函数,并依据层次装配的基本思想,将其与帝国竞争算法融合并引入微分进化算法,通过Matlab编程,以减速器为例进行试验,验证了该算法在装配序列规划方面的可行性,并同帝国竞争算法、遗传算法及蚁群算法进行比较,验证了该改进算法的优越性,为虚拟装配技术的研究奠定了基础。
Imperialist competitive algorithm is studied and improved to solve the problem of assembly sequence planning in virtual assembly process.Adjacency matrix,interference matrix,contact-connection matrix,precedence relation matrix,tool set matrix representing assembly relation of the assembly are obtained based on directed graph method and evaluation index functions about stability,continuity,interference,including stability function,continuity function and the interference function,are established.These evaluation index functions fused with the imperialist competitive algorithm and combined with the differential evolution algorithm are comprehensively studied and improved in the light of the basic idea of hierarchical assembly,whose feasibility in assembly sequence planning is verified through Matlab programming and a reducer illustrated and superiority to imperialist competitive algorithm,differential imperialist competitive algorithm and other algorithms is also testified by comparison,settling the basis for the study of virtual assembly.
作者
李静
张立军
任元
LI Jing;ZHANG Li-jun;REN Yuan(School of Mechatronic Engineering,Changchun University of Technology,Jilin Changchun 130012,China)
出处
《机械设计与制造》
北大核心
2018年第A02期185-189,共5页
Machinery Design & Manufacture
基金
吉林省自然科学基金资助项目(20140101086JC)
关键词
装配序列规划
帝国竞争算法
层次装配
装配关系表达
Assembly Sequence Planning
Imperialist Competitive Algorithm
Hierarchical Assembly
Assembly Rel-ation Expression
