基于层次网格图的拆卸序列生成算法研究  

Research on disassembly sequence generation algorithm based on hierarchy network graph

作　　者：江吉彬[1] 郭伟祥[1] 刘志峰[1] 刘光复[1] 

机构地区：[1]合肥工业大学机械与汽车工程学院,安徽合肥230009

出　　处：《计算机集成制造系统》2004年第9期1129-1133,共5页Computer Integrated Manufacturing Systems

基　　金：国家自然科学重点资助项目(59935120);安徽省自然基金资助项目(01044105);安徽省优秀青年科技基金项目。~~

摘　　要：为了解决拆卸序列生成过程中的组合爆炸问题,提出了一种基于层次网络图的拆卸序列生成方法。通过建立可描述产品组成关系的层次网络图,将产品划分成不同的拆卸部件,并组织在不同层次的单元网络图上;同时,通过节点重组,将节点数目大于拆卸序列生成算法要求上限的单元网络图,拆分成若干新的拆卸部件;基于重组后的网络图,通过图节点拆卸优先约束的分析,可方便地生成产品拆卸序列,且有效避免了因节点数过多而引起的组合爆炸问题。最后,通过一个实例验证了该方法的合理性和有效性。To solve the problem of combination explosion during the disassembly sequence generation process, an approach based on the Hierarchy Network Graph to generate the disassembly sequence was put forward. By creating the Hierarchy Network Graph, product was divided into many disassembly parts, and they were described as Cell Network, which were put at the different levels of the Hierarchy Network Graph. By reorganizing the nodes of the graph, the Cell Network, whose node amount was more than the amount to be asked by the arithmetic of disassembly sequence generation, were rearranged as several new disassembly parts. Based on analyzing the precedence constraints related to the recombining graph, the generating arithmetic of the disassembly sequence was described, and in the arithmetic, the combination explosion can be avoided. At last, a case study was given to show that the method was applicable and effective.

关 键 词：拆卸序列 组合爆炸 层次网格图 优先约束 

分 类 号：TH12[机械工程—机械设计及理论]