.png){kind=icon}
返回
A solution approach based on beam search algorithm for disassembly line balancing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jmsy.2016.09.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The disassembly line balancing (DLB) problem is the process of allocating a set of disassembly tasks to an ordered sequence of workstations in such a way that optimizes some performance measures (e.g., cycle time, number of stations). Since DLB problems belong to the class of NP hard, many heuristic and meta-heuristic algorithms are applied to cope with the complexity of the DLB problems in order to obtain acceptable solutions in a reasonable amount of time. In this study, a beam search (BS) based approach for the DLB problem is proposed. Minimization of number of workstations is used as the performance measure. The proposed algorithm is compared with the optimal solutions of well-known real cases and generated test problems. The results indicate that the proposed approach based on BS is a very competitive and promising tool for further researches. (C) 2016 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.
Keyword:
Beam search
Disassembly line balancing
Meta-heuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
14.2
论文数:
2.7K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
Artificial bee colony algorithm for solving sequence-dependent disassembly line balancing problem人工蜂群算法求解序列相关拆卸线平衡问题
PREAI
分享收藏Multi-objective optimization of stochastic disassembly line balancing with station paralleling车站平行随机拆解线平衡的多目标优化
PREAI
分享收藏Routing straddle carriers for the loading operation of containers using a beam search algorithm
PREAI
分享收藏
查看更多内容