An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem

Two-sided assembly lines are widely applied in plants for producing large-sized high volume products, such as trucks and buses. Since the two-sided assembly line balancing problem (TALBP) is NP-hard, it is difficult to get an optimal solution in polynomial time. Therefore, a novel swarm based heuristic algorithm named gravitational search algorithm (GSA) is proposed to solve this problem with the objective of minimizing the number of mated-stations and the number of stations simultaneously. In order to apply GSA to solving the TALBP, an encoding scheme based on the random-keys method is used to convert the continuous positions of the GSA into the discrete task sequence. In addition, a new decoding scheme is implemented to decrease the idle time related to sequence-dependent finish time of tasks. The corresponding experiment results demonstrate that the proposed algorithm outperforms other well-known algorithms.

Download Full-text

A solution approach based on beam search algorithm for disassembly line balancing problem

Journal of Manufacturing Systems ◽

10.1016/j.jmsy.2016.09.002 ◽

2016 ◽

Vol 41 ◽

pp. 188-200 ◽

Cited By ~ 41

Author(s):

Süleyman Mete ◽

Zeynel Abidin Çil ◽

Kürşad Ağpak ◽

Eren Özceylan ◽

Alexandre Dolgui

Keyword(s):

Search Algorithm ◽

Line Balancing ◽

Beam Search ◽

Solution Approach ◽

Disassembly Line Balancing ◽

Disassembly Line

Download Full-text

A variable neighbourhood search algorithm for disassembly lines

Journal of Manufacturing Technology Management ◽

10.1108/jmtm-11-2013-0168 ◽

2015 ◽

Vol 26 (2) ◽

pp. 182-194 ◽

Cited By ~ 25

Author(s):

Can B. Kalayci ◽

Olcay Polat ◽

Surendra M. Gupta

Keyword(s):

Search Algorithm ◽

Cost Savings ◽

Superior Performance ◽

Line Balancing ◽

Neighborhood Search ◽

Variable Neighbourhood Search ◽

Content Type ◽

Disassembly Line Balancing ◽

Neighbourhood Search ◽

Disassembly Line

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.

Download Full-text