A simulated annealing heuristic for the dynamic facility layout problem Di̇nami̇k tesi̇s düzenleme problemi̇ i̇çi̇n bi̇r tavlama benzeti̇mi̇ sezgi̇seli̇

ŞAHİN R.

Journal of the Faculty of Engineering and Architecture of Gazi University, cilt.23, sa.4, ss.863-870, 2008 (Scopus) identifier identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 23 Sayı: 4
  • Basım Tarihi: 2008
  • Dergi Adı: Journal of the Faculty of Engineering and Architecture of Gazi University
  • Derginin Tarandığı İndeksler: Scopus, TR DİZİN (ULAKBİM)
  • Sayfa Sayıları: ss.863-870
  • Anahtar Kelimeler: Dynamic facility layout problem, Heuristic, Simulated annealing
  • Gazi Üniversitesi Adresli: Evet

Özet

In today's market conditions, increasing global competition, rapid changes in technology and shorter life cycle of product the facility layout to be evaluated as the dynamic facility layout problem (DFLP). The purpose of DFLP is to assign the departments to locations for a multi-period planning horizon so that the sum of the material handling and rearrangement costs is minimized. DFLP is generally formulated as a quadratic assignment problem (QAP) which is NP-hard. The larger the size of the problem, the harder to find the optimal solution. In this paper, a simulated annealing (SA) heuristic is developed to solve the DFLP. To test the performance of the proposed SA heuristic, a set of problems from literature is used. The results obtained show that the proposed heuristic is very effective for DFLP.