An Intelligent Product Disassembly Planning Method

Proceedings of the 2006 IEEE International Symposium on Electronics and the Environment, 2006. Pub Date : 2006-05-08 DOI:10.1109/ISEE.2006.1650092

Wang Hui, Xiang Dong, D. Guanghong

{"title":"An Intelligent Product Disassembly Planning Method","authors":"Wang Hui, Xiang Dong, D. Guanghong","doi":"10.1109/ISEE.2006.1650092","DOIUrl":null,"url":null,"abstract":"Disassembly sequence planning problem is a NP-hard combinatorial optimization problem. Generally, with the increasing of components number, the computational complexity of searching for good disassembly solution(s) in a large search space of disassembly solutions will be increased more. Therefore, to avoid the exploded combination, heuristic methods are often used for the goal of finding optimum solution(s) at a high efficiency. In the proposed research, we present the disassembly feasibility information graph (DFIG) to describe product's disassembly operations (sequences) information. In fact, this graph is a model of simulated all possible disassembly operations, and meanwhile, stored relevant information of operations which includes feasibility of operations and disassembly processes if these operations are feasible. Based on this graph, product's disassembly sequences planning problem could be transformed into this problem: On the DFIG, to find out a path with an optimized sum value, which starts from the start point, and could tour all the components of product just one time, along with the weighed, directed edges","PeriodicalId":141255,"journal":{"name":"Proceedings of the 2006 IEEE International Symposium on Electronics and the Environment, 2006.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2006 IEEE International Symposium on Electronics and the Environment, 2006.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISEE.2006.1650092","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

Disassembly sequence planning problem is a NP-hard combinatorial optimization problem. Generally, with the increasing of components number, the computational complexity of searching for good disassembly solution(s) in a large search space of disassembly solutions will be increased more. Therefore, to avoid the exploded combination, heuristic methods are often used for the goal of finding optimum solution(s) at a high efficiency. In the proposed research, we present the disassembly feasibility information graph (DFIG) to describe product's disassembly operations (sequences) information. In fact, this graph is a model of simulated all possible disassembly operations, and meanwhile, stored relevant information of operations which includes feasibility of operations and disassembly processes if these operations are feasible. Based on this graph, product's disassembly sequences planning problem could be transformed into this problem: On the DFIG, to find out a path with an optimized sum value, which starts from the start point, and could tour all the components of product just one time, along with the weighed, directed edges

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

一种智能产品拆卸规划方法

拆卸顺序规划问题是一个NP-hard组合优化问题。一般情况下，随着部件数量的增加，在大的拆卸解搜索空间中寻找好的拆卸解的计算复杂度也会增加。因此，为了避免爆炸组合，通常采用启发式方法，以高效地找到最优解。在本研究中，我们提出了拆卸可行性信息图(DFIG)来描述产品的拆卸操作(序列)信息。实际上，该图是一个模拟所有可能的拆卸操作的模型，同时存储了操作的相关信息，包括操作的可行性和操作可行时的拆卸过程。基于此图，产品拆解序列规划问题可以转化为:在DFIG上，求出一条从起始点出发，能一次遍历产品所有部件的具有最优和值的路径，以及加权的有向边

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings of the 2006 IEEE International Symposium on Electronics and the Environment, 2006.

自引率

0.00%

发文量