Discrete Shuffled Frog Leading Algorithm for Multiple-product Human-robot Collaborative Disassembly Line Balancing Problem

Document Type

Conference Proceeding

Publication Date

1-1-2022

Abstract

With the rapid development of recycling and remanufacturing technologies, disassembly line balancing problems (DLBP) have drawn great attention. Considering the limitation of disassembly by humans or robots alone, this paper focuses on human-robot collaborative disassembly lines. Specifically, this work proposes a multi-product human-robot collaborative disassembly line balancing model to tackle the inflexibility of single product disassembly and inconsistency in recovery values of different product components. Its objective is to maximize disassembly profit. As a commercially available solver, IBM's CPLEX is used to obtain the exact solution of DLBP and verify the correctness of the proposed mathematical model. A discrete shuffled frog leading algorithm is newly designed to solve the sizable problems. Experimental results show that the proposed algorithm has a fast convergence rate and can find solutions consistent with those with CPLEX but requires much less time than the latter, thus advancing the field of disassembly automation.

Identifier

85142756062 (Scopus)

ISBN

[9781665452588]

Publication Title

Conference Proceedings IEEE International Conference on Systems Man and Cybernetics

External Full Text Location

https://doi.org/10.1109/SMC53654.2022.9945365

ISSN

1062922X

First Page

2490

Last Page

2495

Volume

2022-October

Grant

61573089

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS