A hybrid metaheuristic algorithm for a profit-oriented and energy-efficient disassembly sequencing problem. (February 2020)

• Record Type: Journal Article
• Authors: Lu, Qi; Ren, Yaping; Jin, Hongyue; Meng, Leilei; Li, Lei; Zhang, Chaoyong; Sutherland, John W.
• Is Part Of: Robotics and computer-integrated manufacturing. Volume 61(2020)
• Publication Date: 2020-02
• Subjects: Value recovery -- Disassembly sequencing -- Energy consumption -- AND/OR graph -- Multi-objective metaheuristic; Robots, Industrial -- Periodicals; Computer integrated manufacturing systems -- Periodicals; Robotics -- Periodicals; Robots industriels -- Périodiques; Productique -- Périodiques; Robotique -- Périodiques; 670.285
• DOI: 10.1016/j.rcim.2019.101828
• Languages: English
• ISSNs: 0736-5845

Abstract

Highlights: A profit-oriented and energy-efficient disassembly sequencing problem is studied. The AND/OR graph is used to model our problem. A hybrid multi-objective metaheuristic algorithm is proposed to solve our problem. Abstract: Value recovery from end-of-life products plays a key role in sustainability and circular economy, which starts with disassembly of products into components for reuse, remanufacturing, or recycling. As the process is often complex, a disassembly sequencing problem (DSP) studies how to optimally disassemble products considering the physical constraints between subassemblies/disassembly tasks for maximum profit. With a growing attention on energy conservation, this paper addresses a profit-oriented and energy-efficient DSP (PEDSP), whereby not only the profit is maximized, but also energy consumption is accounted as an important decision criterion. In this work, a disassembly AND/OR graph (DAOG) is used to model a disassembly diagram for a product, in which the 'AND' and 'OR' relations illustrate precedence relationships between subassemblies. Based on the DAOG, we propose a hybrid multi-objective metaheuristic that integrates an artificial bee colony algorithm, a non-dominated sorting procedure, and a variable neighborhood search approach to solve the PEDSP for Pareto solutions. The proposed method is applied to real-world cases (i.e., a simple ballpoint pen and a relatively complex radio) and compared with other multi-objective algorithms. The results indicate that our method can quickly produce a Pareto front that outperforms the alternative approaches.