SavedAdd your journal

Journals / Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi / 2017 / Cilt: 32 - Sayı: 3

NSGA-II and goal programming approach for the multi-single row facility layout problem

Çok amaçlı tek sıra tesis düzenleme probleminin çözümü için NSGA-II ve hedef programlama yaklaşımı

Esra Duygu DURMAZ
Ramazan ŞAHİN
Pages
941–955
Publication Date
2022-10-18
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

These objectives are taken into account for single row facility layout problem, for the first time, in this paper

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Single row facility layout problem is the problem of arranging departments on a straight line.
📊
Key Findings & Data:The main objective of the single row facility layout problem is to minimize the total material handling cost.
💡
Conclusion & Impact:These objectives are taken into account for single row facility layout problem, for the first time, in this paper
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Single row facility layout problem is the problem of arranging departments on a straight line. The main objective of the single row facility layout problem is to minimize the total material handling cost. However, it is not explanatory to use one objective. Hence, researchers pay more attention to model facility layout problems with qualitative and quantitative objectives. In this study, a weighted goal programming approach and a NSGA-II algorithm are proposed to solve multi-objective single row facility layout problem with the objectives of minimizing total flow distance and maximizing closeness rating scores. These objectives are taken into account for single row facility layout problem, for the first time, in this paper

Özet

Tek sıra tesis düzenleme problemi, bölümlerin düz bir hat üzerinde yerleşiminin planlanması problemidir. Tek sıra tesis düzenleme probleminde, genellikle bölümler arası toplam taşıma maliyetlerini en küçüklemek hedeflenmektedir. Ancak, gerçek hayatta tesis düzenleme problemini tek bir amaçla ifade etmek mantıklı olmayacaktır. Bunun için nicel ve nitel amaçları ele alan çok amaçlı modeller üzerinde çalışılmaktadır. Bu çalışmada, toplam akış mesafesini en küçüklemeyi ve bölümler arası yakınlık skorlarını en büyüklemeyi hedefleyen çok amaçlı tek sıra tesis düzenleme problemi ele alınmıştır. Bu amaçlar, tek sıra tesis düzenleme problemi için ilk defa bu çalışmada dikkate alınmıştır. Problemin çözümü için, ağırlıklı hedef programlama yaklaşımı ve NSGA-II algoritması önerilmiştir

🔖

Cite This Article

DURMAZ, E. D., ŞAHİN, R. (2022). NSGA-II and goal programming approach for the multi-single row facility layout problem. Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi, Cilt: 32 - Sayı: 3, 941–955. https://ajindex.com/articles/523595

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (19)

  1. Drira A., Pierreval H., Hajri-Gabouj S., Facility layout problems: A survey, Annu. Rev. Control, 31 (2), 255- 267, 2007
  2. Tompkins J.A., White J.A., Bozer Y.A., Tanchoco J.M., Facilities Planning, John Wiley & Sons, ABD, 2010
  3. Amaral A.R.S., On the exact solution of a facility layout problem, Eur. J. Oper. Res., 173 (2), 508-518, 2006
  4. Lenin N., Kumar M.S., Ravindran D., Islam M.N., A tabu search for multiobjective single row facility layout problem, Journal of Advanced Manufacturing Systems,13 (1), 17-40, 2014
  5. Heragu S.S., Kusiak A., Machine layout problem in flexible manufacturing systems, Oper. Res., 36 (2), 258- 268, 1988
  6. Simmons D.M., One-dimensional space allocation: An ordering algorithm, Oper. Res., 17 (5), 812-826, 1969
  7. Picard J.C., Queyranne M., On the one-dimensional space allocation problem, Oper. Res., 29 (2), 371-391, 1981
  8. Beghin-Picavet M., Hansen P., Deux problemes daffectation nonlineaires, RAIRO, Recherche Operationnelle, 16 (3), 263-276, 1982
  9. Love R.F., Wong J.Y., On solving a one-dimensional space allocation problem with integer programming, INFOR,14 (2), 139-143, 1976
  10. Heragu S.S., Kusiak A., Efficient models for the facility layout problem, Eur. J. Oper. Res., 53 (1), 1-13, 1991
  11. Amaral A.R.S., A new lower bound for the single row facility layout problem, Discrete Appl. Math., 157 (1), 183-190, 2009
  12. Amaral A.R.S., Letchford A.N., A polyhedral approach to the single row facility layout problem, Math. Program., 141 (1-2), 453-477, 2013
  13. Hungerlander P., Rendl F., A computational study and survey of methods for the single-row facility layout problem, Computational Optimization and Applications, 55, 1-20, 2013
  14. Kumar K.R., Hadjinicola G.C., Lin T.L., A heuristic for the single-row facility layout problem, Eur. J. Oper. Res., 87 (1), 65-73, 1995
  15. Braglia M., Heuristics for single-row layout problems in flexible manufacturing systems, Production Planning & Control, 8, 558-567, 1997
  16. Djellab H., Gourgand M., A new heuristic procedure for the single-row facility layout problem, Int. J. Computer Integr. Manuf., 14 (3), 270-280, 2001
  17. Palubeckis G., Fast simulated annealing for single-row equidistant facility layout, Appl. Math. Comput., 263, 287-301, 2015
  18. Kothari R., Ghosh D., Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods, Eur. J. Oper. Res., 224, 93- 100, 2013
  19. Kothari R., Ghosh D., An efficient genetic algorith