A tabu search algorithm for the simple assembly line balancing problem of type-2 with workload balancing objective

Creative Commons License

Arıkan M.

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, cilt.32, sa.4, ss.1169-1179, 2017 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 32 Sayı: 4
  • Basım Tarihi: 2017
  • Doi Numarası: 10.17341/gazimmfd.369529
  • Dergi Adı: JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED)
  • Sayfa Sayıları: ss.1169-1179
  • Anahtar Kelimeler: Assembly line balancing, type-2 simple assembly line balancing problem, tabu search, VARIABLE NEIGHBORHOOD SEARCH, MAXIMIZING PRODUCTION-RATE, GENETIC ALGORITHM, FIXED NUMBER, OPTIMIZATION, HEURISTICS, STATIONS
  • Gazi Üniversitesi Adresli: Evet

Özet

In this study, a tabu search algorithm is developed to solve the bi-objective simple assembly line balancing problem of type-2. The algorithm uses a task oriented solution representation which is usually employed by evolutionary algorithms and is supported by a diversification strategy based on residence frequencies. The performance of the algorithm is tested on 23 instances included in 9 problems taken from the open literature. The computational results validate the effectiveness of the algorithm for both objectives.