A Robust Robotic Disassembly Sequence Design Using Orthogonal Arrays and Task Allocation

Disassembly sequence planning (DSP) is a nondeterministic polynomial time (NP) complete problem, making the utilization of metaheuristic approaches a viable alternative. DSP aims at creating efficient algorithms for deriving the optimum or near-optimum disassembly sequence for a given product or a product family. The problem-specific nature of such algorithms, however, requires these solutions to be validated, proving their versatility in...