Rule-based recursive selective disassembly sequence planning for green design

摘要

Disassembly sequence planning not only reduces product lifecycle cost, but also greatly influences environmental impact. Many prior green design research studies have focused on complete disassembly of an end-of-life product to recover valuable components. 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 focuses on disassembling only one or more selected components from a product for reuse, recycling, remanufacturing, and maintenance. This paper presents a rule-based recursive method for finding a near-optimal heuristic selective disassembly sequence for green design. Most prior methods either enumerate all solutions or use stochastic random methods to generate solutions. Enumerative or stochastic methods often require tremendous computational resources while, at the same time, they often fail to find realistic or optimal solutions. On the contrary, the proposed method establishes certain heuristic disassembly rules to eliminate uncommon or unrealistic solutions. 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. As a result, the developed method can effectively find a near-optimal heuristic solution while greatly reducing computational time and space.