A simulated annealing heuristic for the dynamic layout problem with budget constraint

Şahin R., Ertoğral K., Turkbey O.

COMPUTERS & INDUSTRIAL ENGINEERING, cilt.59, sa.2, ss.308-313, 2010 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 59 Sayı: 2
  • Basım Tarihi: 2010
  • Doi Numarası: 10.1016/j.cie.2010.04.013
  • Dergi Adı: COMPUTERS & INDUSTRIAL ENGINEERING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.308-313
  • Anahtar Kelimeler: Facility layout problem, Dynamic, Budget constraint, Simulated annealing, PLANT LAYOUT, ALGORITHM
  • Gazi Üniversitesi Adresli: Evet

Özet

Facility layout problem has been extensively studied in the literature because the total material handling cost can be a significant portion in the operational costs for a company and in the manufacturing cost of a product. Today's severe global competition, rapid changes in technology and shortening life cycle of products force companies to evaluate and modify their facility layout in a periodic fashion. This type of layout problems is categorized as the dynamic facility layout problem (DFLP). As a realistic dimension of the problem, one has to consider also the limited budget to cover the cost of changing the layout. In this study, we propose a simulated annealing heuristic for the DFLP with budget constraint, and show the effectiveness of this heuristic on a set of numerical experiments. (c) 2010 Elsevier Ltd. All rights reserved.