<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN"
        "https://jats.nlm.nih.gov/publishing/1.4/JATS-journalpublishing1-4.dtd">
<article         dtd-version="1.4">
            <front>

                <journal-meta>
                                    <journal-id></journal-id>
            <journal-title-group>
                                                                                    <journal-title>Doğuş Üniversitesi Dergisi</journal-title>
            </journal-title-group>
                                        <issn pub-type="epub">1308-6979</issn>
                                                                                            <publisher>
                    <publisher-name>Dogus University</publisher-name>
                </publisher>
                    </journal-meta>
                <article-meta>
                                        <article-id/>
                                                                                                                                                                                            <title-group>
                                                                                                                        <trans-title-group xml:lang="en">
                                    <trans-title>FACILITY LAYOUT DESIGN WITH GENETIC ALGORITHMS AND AN  APPLICATION</trans-title>
                                </trans-title-group>
                                                                                                                                                                                                <article-title>GENETİK ALGORİTMALAR İLE TESİS YERLEŞİMİ  TASARIMI VE BİR UYGULAMA</article-title>
                                                                                                    </title-group>
            
                                                    <contrib-group content-type="authors">
                                                                        <contrib contrib-type="author">
                                                                <name>
                                    <surname>Gülsün</surname>
                                    <given-names>Bahadır</given-names>
                                </name>
                                                                    <aff>Yıldız Teknik Üniversitesi,  Makine Fakültesi</aff>
                                                            </contrib>
                                                    <contrib contrib-type="author">
                                                                <name>
                                    <surname>Tuzkaya</surname>
                                    <given-names>Gülfem</given-names>
                                </name>
                                                                    <aff>Yıldız Teknik Üniversitesi,  Makine Fakültesi</aff>
                                                            </contrib>
                                                    <contrib contrib-type="author">
                                                                <name>
                                    <surname>Duman</surname>
                                    <given-names>Cem</given-names>
                                </name>
                                                                    <aff>Legrand Elektrik A.Ş.</aff>
                                                            </contrib>
                                                                                </contrib-group>
                        
                                        <pub-date pub-type="pub" iso-8601-date="20090101">
                    <day>01</day>
                    <month>01</month>
                    <year>2009</year>
                </pub-date>
                                        <volume>10</volume>
                                        <issue>1</issue>
                                        <fpage>73</fpage>
                                        <lpage>87</lpage>
                        
                        <history>
                                            </history>
                                        <permissions>
                    <copyright-statement>Copyright © 2000, Dogus University Journal</copyright-statement>
                    <copyright-year>2000</copyright-year>
                    <copyright-holder>Dogus University Journal</copyright-holder>
                </permissions>
            
                                                                                                <trans-abstract xml:lang="en">
                            <p>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</p></trans-abstract>
                                                                                                                                    <abstract><p>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.</p></abstract>
                                                            
            
                                                                                        <kwd-group>
                                                    <kwd>Tesis Yerleşim Tasarımı</kwd>
                                                    <kwd>   Genetik Algoritmalar</kwd>
                                                    <kwd>   Karesel Atama Problemi</kwd>
                                            </kwd-group>
                            
                                                <kwd-group xml:lang="en">
                                                    <kwd>Facility Layout Design </kwd>
                                                    <kwd>   Genetic Algorithms </kwd>
                                                    <kwd>   Quadratic Assignment Problem</kwd>
                                            </kwd-group>
                                                                                                                                        </article-meta>
    </front>
    <back>
                            <ref-list>
                                    <ref id="ref1">
                        <label>1</label>
                        <mixed-citation publication-type="journal">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.</mixed-citation>
                    </ref>
                                    <ref id="ref2">
                        <label>2</label>
                        <mixed-citation publication-type="journal">ANGEL, E., ZISSIMOPOULOS, V. (2001). On the landspace ruggedness of the quadratic assignment problems, Theoretical Computer Science, 263 (1-2), 159- 172. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref3">
                        <label>3</label>
                        <mixed-citation publication-type="journal">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.</mixed-citation>
                    </ref>
                                    <ref id="ref4">
                        <label>4</label>
                        <mixed-citation publication-type="journal">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.</mixed-citation>
                    </ref>
                                    <ref id="ref5">
                        <label>5</label>
                        <mixed-citation publication-type="journal">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.</mixed-citation>
                    </ref>
                                    <ref id="ref6">
                        <label>6</label>
                        <mixed-citation publication-type="journal">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].</mixed-citation>
                    </ref>
                                    <ref id="ref7">
                        <label>7</label>
                        <mixed-citation publication-type="journal">ÇELA, E. (1998). The quadratic assignment problem: Theory and algorithms. London: Kluwer Academic Publishers.</mixed-citation>
                    </ref>
                                    <ref id="ref8">
                        <label>8</label>
                        <mixed-citation publication-type="journal">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.</mixed-citation>
                    </ref>
                                    <ref id="ref9">
                        <label>9</label>
                        <mixed-citation publication-type="journal">CHRISTOFIDES, N., BENAVENT, E. (1964). An exact algorithm for the quadratic assignment problem, Operation Research, 37, 760-768. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref10">
                        <label>10</label>
                        <mixed-citation publication-type="journal">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.</mixed-citation>
                    </ref>
                                    <ref id="ref11">
                        <label>11</label>
                        <mixed-citation publication-type="journal">DREZNER, Z. (2008). Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem, Computers &amp; Operations Research, 35, 717-736. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref12">
                        <label>12</label>
                        <mixed-citation publication-type="journal">DUMAN, E., OR, I. (2007). The quadratic assignment problem in the context of the printed circuit board assembly process, Computers &amp; Operations Research, 34, 163-179. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref13">
                        <label>13</label>
                        <mixed-citation publication-type="journal">EL-BAZ, M.A., (2004) A genetic algorithm for facility layout problems of different manufacturing environments, Computers &amp; Industrial Engineering, 47, 233-246. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref14">
                        <label>14</label>
                        <mixed-citation publication-type="journal">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.</mixed-citation>
                    </ref>
                                    <ref id="ref15">
                        <label>15</label>
                        <mixed-citation publication-type="journal">FRANCIS, R.L., WHITE, J.A. (1974). Facility layout and location, Englewood Cliffs, N.J.: Printice-Hall</mixed-citation>
                    </ref>
                                    <ref id="ref16">
                        <label>16</label>
                        <mixed-citation publication-type="journal">GOLDBERG, D.E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Massachusetts: Addison-Wesley Publishing Company.</mixed-citation>
                    </ref>
                                    <ref id="ref17">
                        <label>17</label>
                        <mixed-citation publication-type="journal">GOLDBERG, E.F.G., MACULAN, N., GOLDBARG, M.C. (2008). A new neighborhood for the QAP, Electronic Notes in Discrete Mathematics, 30, 3-8. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref18">
                        <label>18</label>
                        <mixed-citation publication-type="journal">HAHN, P., GRANT, T., HALL, N. (1998). A branch-and-bound algorithm fort he quadratic assignment problem based Hungarian method, European Journal of Operational Research, 108 (3), 629-640. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref19">
                        <label>19</label>
                        <mixed-citation publication-type="journal">HILLIER, F.S., CONNORS, M.M. (1966). Quadratic assignment problem algorithms and location of invisible facilities, Management Science, 13 (1), 42- 57. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref20">
                        <label>20</label>
                        <mixed-citation publication-type="journal">HOLLAND, J.H. (1975) Adaption in natural and artificial systems, Cambridge: MIT Press</mixed-citation>
                    </ref>
                                    <ref id="ref21">
                        <label>21</label>
                        <mixed-citation publication-type="journal">KOOPMANS, T.C., BECKMAN, M. (1957). Assignment problems and the location of economic activities, Econometrica, 25, 53-76. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref22">
                        <label>22</label>
                        <mixed-citation publication-type="journal">LAWLER, E. (1963). The quadratic assignment problem, Management Science, 9, 856-599. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref23">
                        <label>23</label>
                        <mixed-citation publication-type="journal">LIGGET, R.S. (1981). The quadratic assignment problem, Management Science, 27 (4), 442-458. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref24">
                        <label>24</label>
                        <mixed-citation publication-type="journal">LOIOLA, E.M., ABREU, N.M.M. de, BOAVENTURA-NETTO, P.O., HAHN, P., QUERIDO, T. (1998). A survey for the quadratic assignment problem, European Journal of Operational Research, 176, 657-690. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref25">
                        <label>25</label>
                        <mixed-citation publication-type="journal">MANS, B., MAUTOR, T., ROUCAIROL, C. (1995). A parallel depth first search branch and bound algorithm for the quadratic assignment problem, European Journal of Operational Research, 81(3), 617-628. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref26">
                        <label>26</label>
                        <mixed-citation publication-type="journal">RAMKUMAR, A.S., PONNAMBALAM, S.G., JAWAHAR, N., SURESH, R.K. (2008). Iterated fast local search algorithm for solving quadratic assignment problems, Robotics and Computer-Integrated Manufacturing, 24 (3), 392-401. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref27">
                        <label>27</label>
                        <mixed-citation publication-type="journal">RENDL, F. (2002). The quadratic assignment problem, Z. DREZNER, H. HAMACHER (ed.). Facility location: applications and theory, İçinde, Berlin: Springer.</mixed-citation>
                    </ref>
                                    <ref id="ref28">
                        <label>28</label>
                        <mixed-citation publication-type="journal">ROSENBLATT, M.J. (1986) The Dynamics of plant layout, Management Science, 32 (l), 76-86. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref29">
                        <label>29</label>
                        <mixed-citation publication-type="journal">ROUCAIROL, C. (1987). A parallel branch and bound algorithm for the quadratic assignment problem, Discrete Applied Mathematics, 18 (2), 211-225. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref30">
                        <label>30</label>
                        <mixed-citation publication-type="journal">SOLIMANPUR, M., VRAT, P., SHANKAR, R. (2004). Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing, European Journal of Operational Research, 157, 592-606. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref31">
                        <label>31</label>
                        <mixed-citation publication-type="journal">STUTZLE, T. (2006). Iterated local search for the quadratic assignment problem, European Journal of Operational Research, 174 (3), 1519-1539. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref32">
                        <label>32</label>
                        <mixed-citation publication-type="journal">TAILLARD, E.D., (1995). Comparison of iterative searches for the quadratic assignment problem, Location Science, 3, 87-105. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref33">
                        <label>33</label>
                        <mixed-citation publication-type="journal">TATE, D.M., SMITH, A.E. (1995) Genetic Approach to The Quadratic Assignment Problem, Computers and Operations Research, 22 (1), 73-83. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref34">
                        <label>34</label>
                        <mixed-citation publication-type="journal">TAVAKKOLI-MOGHADDAIN, R., SHAYAN, E. (1998) Facilities layout design by genetic algorithms, Computers and Industrial Engineering, 35(3-4), 527-530. ss.</mixed-citation>
                    </ref>
                                    <ref id="ref35">
                        <label>35</label>
                        <mixed-citation publication-type="journal">WALL, M. (1996-1999) GALib [Internet], Massachusetts Institute of Technology (MIT). [Erişim adresi]:http://lancet.mit.edu/ga/, [Erişim tarihi: 10/06/2007].</mixed-citation>
                    </ref>
                            </ref-list>
                    </back>
    </article>
