Rule-Based Recursive Selective Disassembly Sequence Planning for Green Design
Date Issued
2009
Date
2009
Author(s)
Chen, Wei-Hsiang
Abstract
Disassembly sequence planning not only reduces product lifecycle cost, but also greatly influences environmental impact. Therefore, many prior green design research studies have focused on complete disassembly of an end-of-life product to reuse, recycle, recovery, and remanufacturing useful or valuable components. To reduce environmental impact, many countries set up certain regulations to avoid importing environmental unfriendly products. In green design, it is important to consider environmental regulations during the disassembly sequence planning stages. However, complete disassembly is often not practical or cost effective if only a few components will be recovered and recycled from a given product. Selective disassembly sequence planning is usually used to only disassemble one or more components from a product to reuse, recycle, recovery and remanufacturing to reduce environmental impact.ost prior methods either enumerate all solutions or use a stochastic method to generate random solutions. Enumerative or stochastic methods often require tremendous computational resources while, at the same time, they often fail to find realistic or optimal solutions. This thesis presents a rule-based recursive method for finding an optimal heuristic selective disassembly sequence for green design. Based on certain heuristic disassembly rules, the proposed method can eliminate uncommon or unrealistic solutions. Thus, it can greatly reduce computational resources and find high-quality solutions effectively. ased on the defined rules, before any component can be removed, its attached fasteners need to be removed first. However, before the fasteners can be removed, other components or fasteners might need to be removed. In this research, three major functions are developed to handle the recursive removal of components and fasteners. In addition, rather than considering geometric constraints for each pair of components, the developed method only considers geometric relationships between a part and its neighboring parts. If a retrieved part can be disassembled, its geometric relationships with the neighboring parts will dynamically be deleted and updated. As a result, the developed method can effectively find an optimal heuristic selective disassembly sequence while greatly reducing computational time and space.
Subjects
rule
recursive
selective
disassembly
green design
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-98-R95522626-1.pdf
Size
23.53 KB
Format
Adobe PDF
Checksum
(MD5):29716ce15162f0932aee8c12a14dbb15