Assembly sequence planning prob-lem is a typical combinatorial optimization problem,itis prone to lead to combinatorial explosion problem.Toreduce the searching space of the algorithm of the assem·bly sequence planning,based on the connection graph ofthe product,through the research about the connectionamong the components,the classification of the connectionstability is made,the weighted graph that is based on theconnection stability is established.According to the con-nection stability among the components,the assembly ispartitioned several subassemblies.While according to thesimilarities of the function and the structure among somesubassemblies,the similar subassemblies are constructed.%产品装配序列规划问题是一个典型的组合优化问题,在求解过程中容易导致组合爆炸.通过将复杂的产品划分成一个个合理的子装配体,可以有效地解决装配序列规划搜索空间过大的问题.本文以产品连接关系图为基础,通过研究产品各个部件之间的连接关系,对连接关系的稳定性进行分类,基于连接关系稳定性建立权重连接关系图,进行子装配体的划分;同时,根据子装配体功能和结构的相似性,构造相似子装配体.本文所求得的子装配体具有较好的稳定性和均衡性.
展开▼