A hybrid metaheuristic algorithm for a profit-oriented and energy-efficient disassembly sequencing problem

Qi Lu, Yaping Ren, Hongyue Jin, Leilei Meng, Lei Li, Chaoyong Zhang, John W. Sutherland

Research output: Contribution to journalArticle

2 Citations (Scopus)

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.

Original languageEnglish (US)
Article number101828
JournalRobotics and Computer-Integrated Manufacturing
Volume61
DOIs
StatePublished - Feb 2020

Fingerprint

Hybrid Metaheuristics
Disassembly
Profitability
Energy Efficient
Sequencing
Energy Consumption
Profit
Energy utilization
Optimization
Sorting
Recycling
Sustainable development
Energy conservation
Remanufacturing
Pareto Solutions
Variable Neighborhood Search
Pareto Front
Recovery
Energy Conservation
Sustainability

Keywords

  • AND/OR graph
  • Disassembly sequencing
  • Energy consumption
  • Multi-objective metaheuristic
  • Value recovery

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Mathematics(all)
  • Computer Science Applications
  • Industrial and Manufacturing Engineering

Cite this

A hybrid metaheuristic algorithm for a profit-oriented and energy-efficient disassembly sequencing problem. / Lu, Qi; Ren, Yaping; Jin, Hongyue; Meng, Leilei; Li, Lei; Zhang, Chaoyong; Sutherland, John W.

In: Robotics and Computer-Integrated Manufacturing, Vol. 61, 101828, 02.2020.

Research output: Contribution to journalArticle

@article{f45be2fe2d1d47a3961b5b67f518a21a,
title = "A hybrid metaheuristic algorithm for a profit-oriented and energy-efficient disassembly sequencing 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.",
keywords = "AND/OR graph, Disassembly sequencing, Energy consumption, Multi-objective metaheuristic, Value recovery",
author = "Qi Lu and Yaping Ren and Hongyue Jin and Leilei Meng and Lei Li and Chaoyong Zhang and Sutherland, {John W.}",
year = "2020",
month = "2",
doi = "10.1016/j.rcim.2019.101828",
language = "English (US)",
volume = "61",
journal = "Robotics and Computer-Integrated Manufacturing",
issn = "0736-5845",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - A hybrid metaheuristic algorithm for a profit-oriented and energy-efficient disassembly sequencing problem

AU - Lu, Qi

AU - Ren, Yaping

AU - Jin, Hongyue

AU - Meng, Leilei

AU - Li, Lei

AU - Zhang, Chaoyong

AU - Sutherland, John W.

PY - 2020/2

Y1 - 2020/2

N2 - 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.

AB - 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.

KW - AND/OR graph

KW - Disassembly sequencing

KW - Energy consumption

KW - Multi-objective metaheuristic

KW - Value recovery

UR - http://www.scopus.com/inward/record.url?scp=85068172266&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068172266&partnerID=8YFLogxK

U2 - 10.1016/j.rcim.2019.101828

DO - 10.1016/j.rcim.2019.101828

M3 - Article

AN - SCOPUS:85068172266

VL - 61

JO - Robotics and Computer-Integrated Manufacturing

JF - Robotics and Computer-Integrated Manufacturing

SN - 0736-5845

M1 - 101828

ER -