A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time

Mete S., Serin F., Cil Z. A., Celik E., ÖZCEYLAN E.

ANNALS OF OPERATIONS RESEARCH, cilt.321, sa.1-2, ss.371-408, 2023 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 321 Sayı: 1-2
  • Basım Tarihi: 2023
  • Doi Numarası: 10.1007/s10479-022-04910-1
  • Dergi Adı: ANNALS OF OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, ABI/INFORM, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Computer & Applied Sciences, INSPEC, Public Affairs Index, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.371-408
  • Anahtar Kelimeler: Genetic algorithm, Dijkstra algorithm, Disassembly line balancing, Piecewise linear, Simulated annealing, Stochastic task times, ANT COLONY OPTIMIZATION, MATHEMATICAL-MODEL, GENETIC ALGORITHM, SEARCH ALGORITHM, NETWORK
  • İstanbul Üniversitesi Adresli: Evet

Özet

The balancing of the disassembly line directly affects the productivity of the disassembly process. The disassembly line balancing (DLB) problem can be determined as assigning the tasks to serial workstations to optimize some performance measures like number of workstations, cycle time, removing hazardous parts earlier, etc. The aim of the paper is to develop an efficient heuristic algorithm to minimize the number of workstations under a pre-known cycle time. In this paper, a genetic algorithm (GA) and a constructive heuristic based on the Dijkstra algorithm is proposed to solve the DLB problem with stochastic task times that is caused by the nature of disassembly operation. The proposed algorithms are tested on benchmark problems and compared with the results of the piecewise-linear model (PLM) and simulated annealing (SA). The average relative percentage deviation is applied to transfer the obtained number of workstations. The results obtained by GA are clearly superior in all tests problem according to average relative percentage deviation. Moreover, the proposed constructive heuristic based on the Dijkstra algorithm is also superior to PLM and SA algorithm with respect to number of workstations and the computational times. The proposed approaches can be a very competitive and promising tool for further research in DLB literature and real cases in industries according to test results. Disassembly lines which need less time or number of workstations for balancing may be simply designed by the proposed techniques.