A Solution Approach Based on Beam Search Algorithm for Disassembly Line Balancing Problem

Mete Süleyman , Abidin Zeynel , Ağpak Kürşad , Eren Özceylan , Alexandre Dolgui (1, 2)

1 IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
2 Mines Nantes - Mines Nantes

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

Mots clés: Disassembly line balancing; Metaheuristics; Beam search

Domaines: Recherche opérationnelle [math.OC]

Mete Süleyman, Abidin Zeynel, Ağpak Kürşad, Eren Özceylan, Alexandre Dolgui. A Solution Approach Based on Beam Search Algorithm for Disassembly Line Balancing Problem. Journal of Manufacturing Systems, 2016, 41, pp.188-200. ⟨10.1016/j.jmsy.2016.09.002⟩. ⟨hal-01435661⟩