Sequence Planning for Selective Disassembly Aiming at Reducing Energy Consumption Using a Constraints Relation Graph and Improved Ant Colony Optimization Algorithm

Bingtao Hu, Yixiong Feng, Hao Zheng and Jianrong Tan
Additional contact information
Bingtao Hu: State Key Laboratory of Fluid Power and Mechatronic Systems, Zhejiang University, Hangzhou 310027, China
Yixiong Feng: State Key Laboratory of Fluid Power and Mechatronic Systems, Zhejiang University, Hangzhou 310027, China
Hao Zheng: State Key Laboratory of Fluid Power and Mechatronic Systems, Zhejiang University, Hangzhou 310027, China
Jianrong Tan: State Key Laboratory of Fluid Power and Mechatronic Systems, Zhejiang University, Hangzhou 310027, China

Energies, 2018, vol. 11, issue 8, 1-18

Abstract: With environmental pollution and the shortage of resources becoming increasingly serious, the disassembly of certain component in mechanical products for reuse and recycling has received more attention. However, how to model a complex mechanical product accurately and simply, and minimize the number of components involved in the disassembly process remain unsolved problems. The identification of subassembly can reduce energy consumption, but the process is recursive and may change the number of components to be disassembled. In this paper, a method aiming at reducing the energy consumption based on the constraints relation graph (CRG) and the improved ant colony optimization algorithm (IACO) is proposed to find the optimal disassembly sequence. Using the CRG, the subassembly is identified and the number of components that need to be disassembled is minimized. Subsequently, the optimal disassembly sequence can be planned using IACO where a new pheromone factor is proposed to improve the convergence performance of the ant colony algorithm. Furthermore, a case study is presented to illustrate the effectiveness of the proposed method.

Keywords: energy consumption; selective disassembly; disassembly sequence planning; constraints relation graph; improved ant colony optimization algorithm (search for similar items in EconPapers)
JEL-codes: Q Q0 Q4 Q40 Q41 Q42 Q43 Q47 Q48 Q49 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/1996-1073/11/8/2106/pdf (application/pdf)
https://www.mdpi.com/1996-1073/11/8/2106/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jeners:v:11:y:2018:i:8:p:2106-:d:163534

Access Statistics for this article

Energies is currently edited by Ms. Agatha Cao

More articles in Energies from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().