Paper Info
Title
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.
Year
DOI
Venue
2020
10.1080/00207543.2019.1630774
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
Keywords
DocType
Volume
combinatorial optimisation, branch and bound remember, disassembly, line balancing, exact solution algorithm
Journal
58
Issue
ISSN
Citations 
11
0020-7543
2
PageRank 
References 
Authors
0.37
0
4
Name
Order
Citations
PageRank
Zixiang Li151.10
Zeynel Abidin Çil2102.19
Süleyman Mete340.74
ibrahim kucukkoc4537.74