A hybrid meta-heuristic approach for solving SALBP

Ozmehmet S., Tunali S.

35th International Conference on Computers and Industrial Engineering, ICC and IE 2005, İstanbul, Türkiye, 19 - 22 Haziran 2005, ss.1475-1480 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Basıldığı Şehir: İstanbul
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.1475-1480
  • Anahtar Kelimeler: Assembly line balancing, Genetic algorithms, Meta-heuristic
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

In this paper, a hybrid meta-heuristic approach combining genetic algorithm (GA) with tabu search (TS) is proposed to solve simple assembly line balancing problem (SALBP). This hybrid approach combines the advantages of the two algorithms and mitigates the disadvantages. Pure GAs are able to locate the promising regions for global optima in a search space, but sometimes have difficulty in finding the exact minimum of these optima. Especially, since the search space for the assembly line balancing is very large, it is likely that the solutions found by pure GAs can still be improved using TS. By guiding the proposed GA to new areas, TS has the potential to overcome the local minima and hopefully reach the global optimum. The performance of the proposed hybrid GA approach against pure GA has been demonstrated using a numerical example.