.png){kind=icon}
返回
A variable neighbourhood search algorithm for disassembly lines
.png){kind=icon}
PRE
AI
DOI：10.1108/JMTM-11-2013-0168.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Disassembly line balancing
Sequence-dependent
Disassembly
Variable neighborhood search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
711
被引数:
5.1K
机构
引用论文
Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem人工蜂群算法求解序列相关拆卸线平衡问题
.png){kind=icon}
PREAI
分享收藏Multi-objective optimization of stochastic disassembly line balancing with station paralleling车站平行随机拆解线平衡的多目标优化
PREAI
分享收藏
查看更多内容