A simulated annealing algorithm for dynamic layout problem

Baykasoglu A., Gindy N.

COMPUTERS & OPERATIONS RESEARCH, cilt.28, sa.14, ss.1403-1426, 2001 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 28 Sayı: 14
  • Basım Tarihi: 2001
  • Doi Numarası: 10.1016/s0305-0548(00)00049-6
  • Dergi Adı: COMPUTERS & OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1403-1426
  • Anahtar Kelimeler: simulated annealing, dynamic layout, optimization, GENETIC SEARCH, OPTIMIZATION
  • Dokuz Eylül Üniversitesi Adresli: Hayır

Özet

Increased level of volatility in today's manufacturing world demanded new approaches for modelling and solving many of its well-known problems like the facility layout problem. Over a decade ago Rosenblatt published a key paper on modelling and solving dynamic version of the facility layout problems. Since then various other researchers proposed new and improved models and algorithms to solve the problem. Balakrishnan and Cheng have recently published a comprehensive review of the literature about this subject. The problem was defined as a complex combinatorial optimisation problem. The efficiency of SA in solving combinatorial. optimisation problems is very well known. However, it has recently not been applied to DLP based on the review of the available literature. In this research paper a SA-based procedure for DLP is developed and results for test problems are reported.