A fast branch, bound and remember algorithm for disassembly line balancing problem

Abstract

In recent years, the interests of disassembly line have increased owing to economic reasons and the increase of environmental awareness. Effective line can provide many advantages in terms of economic aspect and it facilitates competition the companies with others. This study contributes to the relevant literature by a branch, bound and remember algorithm for disassembly line balancing problem with AND/OR precedence. The proposed exact solution method employs the memory-based dominance rule to eliminate the reduplicated sub-problems by storing all the searched sub-problems and to utilise cyclic best-first search strategy to obtain high-quality complete solutions fast. In this paper, minimising the number of stations is taken as the performance measure. The proposed methodology is tested on a set of 260 instances and compared with the mathematical model using CPLEX solver and five well-known metaheuristics. Computational results show that the proposed method is capable of obtaining the optimal solutions for all the tested instances with less than 0.1 seconds on average. Additionally, comparative study demonstrates that the proposed method is the state-of-the-art algorithm and outperforms the CPLEX solver and metaheuristics in terms of both solution quality and search speed aspects.

Keywords:

• combinatorial optimisation
• branch and bound remember
• disassembly
• line balancing
• exact solution algorithm

Disclosure statement

No potential conflict of interest was reported by the authors.

ORCID

Zeynel Abidin Çil http://orcid.org/0000-0002-7270-9321

Süleyman Mete http://orcid.org/0000-0001-7631-5584

Ibrahim Kucukkoc http://orcid.org/0000-0001-6042-6896

Correction Statement

This article has been republished with minor changes. These changes do not impact the academic content of the article.

Additional information

Funding

This work was supported by National Natural Science Foundation of China: [Grant Number 61803287].