基于蚁群算法的产品拆卸序列规划研究  

Product disassembly sequence planning based on ant colony algorithm

作　　者：王辉[1] 向东[1] 段广洪[1] 

机构地区：[1]清华大学精密仪器与机械学系,北京100084

出　　处：《计算机集成制造系统》2006年第9期1431-1437,共7页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(50445003);国家863/CIMS主题资助项目(2004AA420120)~~

摘　　要：为了能以较高的效率求解出产品拆卸序列的方案,首先阐述了拆卸可行性信息图的概念,将产品的拆卸序列规划问题转述成对该加权有向图中具备最优值的路径搜索和寻优问题。提出了一种蚁群优化算法,并结合对产品元件的拆卸路径求解工具,以实现对产品拆卸可行性信息图的构建和对拆卸方案的搜索和寻优。蚂蚁的一条遍历路径代表了一个描述产品元件拆卸的方案;蚂蚁已经遍历过的路径上代表可行操作的节点数决定了其留下的信息素。启发式信息的求解分为两个部分,包括了确定启发式向量和求出启发式信息值,它们分别表征了方案的可行性及其优异程度。最后,通过一个实例,验证了这一方法的可行性及其计算效率。To solve product disassembly sequence planning problem efficiently, Disassembly Feasibility Information Graph （DFIG） was defined firstly. Based on this graph, the problem of disassembly sequence planning was transformed into the problem of searching optimum path in this directed, weighted graph. Combined with product path planning tool, an ant colony optimization algorithm was proposed to construct DFIG and search optimum solutions. A tour of ant represented a possible product disassembly solution. The pheromone of ant was determined by the number of feasible operation nodes of its tour. It was by two steps to get heuristic information： defining heuristic vector -representing the feasibility of solution- and solving heuristic information- representing the quality of solution. Finally, by a study case, the feasibility and calculation efficiency of the proposed method were verified.

关 键 词：拆卸序列规划 蚁群优化算法 拆卸可行性信息图 

分 类 号：TH122[机械工程—机械设计及理论] TP278[自动化与计算机技术—检测技术与自动化装置]