Journals / Doğuş Üniversitesi Dergisi / 2009 / Cilt: 10 - Sayı: 1

Facility Layout Design with Genetic Algorithms and an Application

Genetik Algoritmalar ile Tesis Yerleşimi Tasarımı ve Bir Uygulama

Pages
73–87
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)

The methodology is applied to a supplier in the structural electricity materials manufacturing sector and a %41 decrease in the transportation costs is expected with the redesign of the facility.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Design of the facility layouts have important effects on the operational productivity and efficiency of a facility.
📊
Key Findings & Data:The methodology is coded via Visual Studio C++ 6.0 and the program is called LO (Layout Optimizer).
💡
Conclusion & Impact:The methodology is applied to a supplier in the structural electricity materials manufacturing sector and a %41 decrease in the transportation costs is expected with the redesign of the facility.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Design of the facility layouts have important effects on the operational productivity and efficiency of a facility. Facility layout design problems (FLDP) are the problems that should consider the flow relations between departments and in the literature the use of Quadratic Assignment Problems (QAP) for these kinds of problems is very frequently applied. Since, for QAP, the FLDP is NP-Hard, in this study, Genetic Algorithms (GA) is utilized. The methodology is coded via Visual Studio C++ 6.0 and the program is called LO (Layout Optimizer). The methodology is tested with QAP library test problems and the difference between LO results and the best known results are less than %1 for each problem. The methodology is applied to a supplier in the structural electricity materials manufacturing sector and a %41 decrease in the transportation costs is expected with the redesign of the facility.

Özet

Tesis yerleşiminin en uygun bir şekilde tasarlanması, üretim tesislerinin etkin ve verimli bir şekilde işletilebilmesinde önemli bir role sahiptir. Tesis yerleşim tasarımı problemleri, çeşitli akış ilişkilerinin de değerlendirilmesini gerektiren problemlerdir ve literatürde Karesel Atama Problemleri (KAP) olarak çözümlendirilmesi yoluna sıkça gidilmiştir. KAP için tesis yerleşimi tasarımı NP-Zor sınıfına girmektedir ve bu nedenle, bu çalışmada, bu tarz problemlere çözüm getirmesi açısından başarılı bir metot olan Genetik Algoritmalar (GA)’dan faydalanılmıştır. Visual Studio C++ 6.0 ortamında LO (Layout Optimizer -Yerleşim En İyileyici) isimli bir yazılım geliştirilmiştir. Bu yazılımla elde edilen sonuçlar, KAP kütüphanesinden alınan literatür problemleriyle test edilmiştir ve her problem için bilinen en iyi çözüme %99’dan daha fazla bir oranda yaklaşılmıştır. Metodoloji, yapısal elektrik malzemeleri imalat sektöründe bir tedarikçi firma için uygulanmıştır ve taşıma maliyetlerinde % 41’lik bir iyileşme sağlanabileceği ortaya konulmuştur.

🔖

Cite This Article

GÜLSÜN, B., TUZKAYA, G., DUMAN, C. (2009). Facility Layout Design with Genetic Algorithms and an Application. Doğuş Üniversitesi Dergisi, Cilt: 10 - Sayı: 1, 73–87. https://ajindex.com/articles/128675

📄 Full Text PDF Viewer

📄

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

References (4)

  1. ADAMS, W.P., GUIGNARD, M., HAHN, P.M. HIGHTOWER, W.L. (2007). A level-2 reformulation-linearization technique bound for the quadratic assignment problem, European Journal of Operational Research, 180 (3), 983-996. ss. ANGEL, E., ZISSIMOPOULOS, V. (2001). On the landspace ruggedness of the quadratic assignment problems, Theoretical Computer Science, 263 (1-2), 159-172. ss. BAYKASOĞLU, A., DERELİ, T., SABUNCU, I. (2006). An ant colony algorithm for solving budget constraint and unconstraint dynamic facility layout problems, Omega, 34, 385-396. ss. BAZARAA, M.S., SHERALI, M.D. (1980). Bender’s partitioning scheme applied to a new formulation of the quadratic assignment problem, Naval Res Logistics Q, 27, 29-41. ss. BURKARD, R.E. (1990). Location Locations with spatial interactions: the quadratic assignment problem. P.B. MIRCHANDANI, R.L. FRANCIS (editor). Discrete location theory. Berlin: Wiley. BURKARD, R.E., KARISCH, S.E., RENDL, F. (1997). QAPLib [Internet], Graz University of Technology. [Erişim adresi]: http://www.seas.upenn.edu/qaplib/ [Erişim tarihi: 12/06/2007].
  2. ÇELA, E. (1998). The quadratic assignment problem: Theory and algorithms. London: Kluwer Academic Publishers.
  3. CHIANG, W.C., CHIANG, C. (1998). Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation, European Journal of Operational Research, 106, 457-488. ss. CHRISTOFIDES, N., BENAVENT, E. (1964). An exact algorithm for the quadratic assignment problem, Operation Research, 37, 760-768. ss. CHWIF, L., BARRETTO, M.R.P., MOSCATO, L.A. (1998). A solution to the facility layout problem using simulated annealing, Computers in Industry, 36, 125-132. ss. DREZNER, Z. (2008). Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem, Computers & Operations Research, 35, 717-736. ss. DUMAN, E., OR, I. (2007). The quadratic assignment problem in the context of the printed circuit board assembly process, Computers & Operations Research, 34, 163-179. ss. EL-BAZ, M.A., (2004) A genetic algorithm for facility layout problems of different manufacturing environments, Computers & Industrial Engineering, 47, 233-246. ss. ERTAY, T., RUAN, D., TUZKAYA, U.R. (2006) Integrated Data Envelopment Analysis and Analytic Hierarchy for the facility layout design in manufacturing systems, Information Sciences, 176, 237-262. ss. FRANCIS, R.L., WHITE, J.A. (1974).
  4. Facility layout and location, Englewood Cliffs, N.