ENUMERATIVE SEARCH ALGORITHM FOR ROBOTIC DISASSEMBLY LINE BALANCING PROBLEM

Ganesan Kanagaraj, Raju Naresh, and Vincent F. Yu

Keywords

Robotic disassembly line, enumerative search algorithm, transformed AND/OR graph, consecutive assignment, total cost approach

Abstract

End-of-life (EOL) products may contain remanufacturable/hazardous/expensive components and these components are to be split for reuse or for preventing environmental pollution. A well-designed robotic disassembly sequence plan (RDSP) and robotic disassembly line balancing (RDLB) play a major role in optimizing disassembly efficiency before disassembly is completed. Hence, in this paper, a mathematical model is formulated for RDSP and RDLB, the former aims to find the optimum disassembly sequence plan, while the latter aims to find the optimum disassembly line balancing solutions for a robotic disassembly line. An enumerative search algorithm is proposed to find all possible disassembly sequences, and a consecutive assignment scheme is used to assign suitable disassembly tasks to best fit robot in a balanced manner. Disassembly tasks to robots are assigned based on time-based and total cost-based approaches. Simulation results indicate that the proposed approach can not only impact the environment but also increase the economic benefits of disassembly lines.

Important Links:



Go Back