Please use this identifier to cite or link to this item: https://hdl.handle.net/11499/10145
Title: A variable neighbourhood search algorithm for disassembly lines
Authors: Kalayci, Can Berk
Polat, O.
Gupta, S.M.
Keywords: Disassembly
Disassembly line balancing
Sequence-dependent
Variable neighborhood search
Optimization
Algorithm for solving
Design/methodology/approach
End-of-life products
Variable neighbourhood search
Algorithms
Publisher: Emerald Group Publishing Ltd.
Abstract: Purpose: The purpose of this paper is to efficiently solve disassembly line balancing problem (DLBP) and the sequence-dependent disassembly line balancing problem (SDDLBP) which are both known to be NP-complete. Design/methodology/approach: This manuscript utilizes a well-proven metaheuristics solution methodology, namely, variable neighborhood search (VNS), to address the problem. Findings: DLBPs are analyzed using the numerical instances from the literature to show the efficiency of the proposed approach. The proposed algorithm showed superior performance compared to other techniques provided in the literature in terms of robustness to reach better solutions. Practical implications: Since disassembly is the most critical step in end-of-life product treatment, every step toward improving disassembly line balancing brings us closer to cost savings and compelling practicality. Originality/value: This paper is the first adaptation of VNS algorithm for solving DLBP and SDDLBP. © Emerald Group Publishing Limited.
URI: https://hdl.handle.net/11499/10145
https://doi.org/10.1108/JMTM-11-2013-0168
ISSN: 1741-038X
Appears in Collections:Mühendislik Fakültesi Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Show full item record



CORE Recommender

SCOPUSTM   
Citations

67
checked on Oct 13, 2024

WEB OF SCIENCETM
Citations

43
checked on Oct 31, 2024

Page view(s)

28
checked on Aug 24, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.