<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0012-7353</journal-id>
<journal-title><![CDATA[DYNA]]></journal-title>
<abbrev-journal-title><![CDATA[Dyna rev.fac.nac.minas]]></abbrev-journal-title>
<issn>0012-7353</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional de Colombia]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0012-73532019000200255</article-id>
<article-id pub-id-type="doi">10.15446/dyna.v86n209.77527</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Storage allocation optimization model in a Colombian company]]></article-title>
<article-title xml:lang="es"><![CDATA[Modelo de optimización de la asignación de espacios de almacenamientos en una empresa colombiana]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ballesteros-Riveros]]></surname>
<given-names><![CDATA[Frank Alexander]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Arango-Serna]]></surname>
<given-names><![CDATA[Martin Darío]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Adarme-Jaimes]]></surname>
<given-names><![CDATA[Wilson]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Zapata-Cortes]]></surname>
<given-names><![CDATA[Julian Andres]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Nacional de Colombia Facultad de Ingeniería ]]></institution>
<addr-line><![CDATA[Bogotá ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Nacional de Colombia Facultad de Minas ]]></institution>
<addr-line><![CDATA[Medellín ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Institución Universitaria CEIPA Escuela de Administración ]]></institution>
<addr-line><![CDATA[Sabaneta ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2019</year>
</pub-date>
<volume>86</volume>
<numero>209</numero>
<fpage>255</fpage>
<lpage>260</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0012-73532019000200255&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0012-73532019000200255&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0012-73532019000200255&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract Storage allocation in the warehouse consists in deciding the corresponding areas in which the products must be allocated. It can be made using different techniques to establish a specific position for the products. Some applications provide solutions and evaluate results independently, allowing the identification of its potential in warehouses. This paper presents the application of a storage allocation model in a food company considering several products in a defined time horizon. The algorithm identifies the operation area and the corresponding spaces that are required for the allocation of the products, aimed to reduce holding and material handling costs. As a result, the application of the algorithm produces a complete product allocation in each period and improves cost efficiency in the warehouse.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen Para la asignación de espacio en el almacén se utilizan técnicas de ubicación de diversos ítems en espacios determinados. Algunas aplicaciones proporcionan soluciones y evalúan resultados en forma independiente, lo que permite identificar su potencial de implementación en almacenes. En este trabajo se presenta un caso de una empresa de productos alimenticios que maneja diversos tipos de productos, para la cual se propone un algoritmo en el que se pretende realizar una adecuada disposición de los productos en la bodega a lo largo de un horizonte de tiempo definido. Este algoritmo identifica las diferentes áreas operacionales y la cantidad de espacios requeridos en los cuales los productos deber ser ubicados, buscando la reducción de los costos de mantener y manipular los productos. Como resultado, la aplicación de este algoritmo asegura una asignación completa de los productos en cada periodo con una alta eficiencia en costos.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[storage allocation]]></kwd>
<kwd lng="en"><![CDATA[performance indicators]]></kwd>
<kwd lng="en"><![CDATA[warehouse]]></kwd>
<kwd lng="en"><![CDATA[management]]></kwd>
<kwd lng="en"><![CDATA[CPLEX]]></kwd>
<kwd lng="es"><![CDATA[asignación de espacios]]></kwd>
<kwd lng="es"><![CDATA[indicadores de desempeño]]></kwd>
<kwd lng="es"><![CDATA[almacenes]]></kwd>
<kwd lng="es"><![CDATA[administración]]></kwd>
<kwd lng="es"><![CDATA[CPLEX]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>[1]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tompkins]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
<name>
<surname><![CDATA[White]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Bozer]]></surname>
<given-names><![CDATA[Y.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Tanchoco]]></surname>
<given-names><![CDATA[J.M.A]]></given-names>
</name>
</person-group>
<source><![CDATA[Facilities planning]]></source>
<year>2010</year>
<edition>4th Ed</edition>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[John Wiley &amp; Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>[2]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arango-Serna]]></surname>
<given-names><![CDATA[M.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Zapata-Cortes]]></surname>
<given-names><![CDATA[J.A]]></given-names>
</name>
<name>
<surname><![CDATA[Pemberthy]]></surname>
<given-names><![CDATA[J.I]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Reestructuración del layout de la zona de picking en una bodega industrial]]></article-title>
<source><![CDATA[Revista Ingeniería Universidad de los Andes]]></source>
<year>2010</year>
<volume>32</volume>
<page-range>54-61</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>[3]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kouvelis]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Kurawarwala]]></surname>
<given-names><![CDATA[A.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Gutiérrez]]></surname>
<given-names><![CDATA[G.J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algorithms for robust single and multiple period layout planning for manufacturing systems]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>1992</year>
<volume>63</volume>
<page-range>287-303</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>[4]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Stützle]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Iterated local search for the quadratic assignment problem]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2006</year>
<volume>174</volume>
<page-range>1519-39</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>[5]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baker]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Canessa]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Warehouse design: a structured approach]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2009</year>
<volume>193</volume>
<page-range>425-36</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>[6]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Da Cunha-Reis]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Gomes-de Souza]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Nogeira-da Costa]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Warehouse design: a systematic literature review]]></article-title>
<source><![CDATA[Brazilian Journal of Operations &amp; Production Management]]></source>
<year>2017</year>
<volume>14</volume>
<page-range>542-55</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>[7]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kostrzewski]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The procedure of warehouses designing as an integral part of the warehouses designing method and the designing software]]></article-title>
<source><![CDATA[International Journal of Mathematical Models and Methods in Applied Sciences]]></source>
<year>2012</year>
<volume>6</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>535-43</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>[8]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Behnamian]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Eghtedari]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Storage system layout. In facility location]]></article-title>
<source><![CDATA[Physica-Verlag HD]]></source>
<year>2009</year>
<page-range>419-50</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>[9]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mati&#263;]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Filipovi&#263;]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Savi&#263;]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Stanimirovi&#263;]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm for solving multiple warehouse problem]]></article-title>
<source><![CDATA[Kragujevac Journal of Mathematics]]></source>
<year>2011</year>
<volume>35</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>119-38</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>[10]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Combining path relinking and genetic algorithms for multiple-level warehouse layout problem]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2006</year>
<volume>169</volume>
<page-range>413-25</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>[11]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[El Koury]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Arnaut]]></surname>
<given-names><![CDATA[J.P]]></given-names>
</name>
<name>
<surname><![CDATA[Engemann]]></surname>
<given-names><![CDATA[K.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Gil-Lafuente]]></surname>
<given-names><![CDATA[A.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Merigo]]></surname>
<given-names><![CDATA[J.M]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheuristic for the multiple level warehouse layout problem]]></source>
<year>2012</year>
<volume>115</volume>
<conf-name><![CDATA[ Modeling and simulation in engineering, economics and management, Proceedings International Conference, MS 2012]]></conf-name>
<conf-loc>New Rochelle, NY, USA </conf-loc>
<page-range>240-8</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>[12]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tabu search approaches for the multi-level warehouse layout problem with adjacency constraints]]></article-title>
<source><![CDATA[Engineering Optimization]]></source>
<year>2010</year>
<volume>42</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>775-90</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>[13]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sanei]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Nasiri]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Marjani]]></surname>
<given-names><![CDATA[M.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Moattar]]></surname>
<given-names><![CDATA[S.M]]></given-names>
</name>
</person-group>
<source><![CDATA[A heuristic algorithm for the warehouse space assignment problem considering operational constraints: with application in a case study]]></source>
<year>2011</year>
<conf-name><![CDATA[ 2011 International Conference on Industrial Engineering and Operations Management]]></conf-name>
<conf-loc>Kuala Lumpur, Malaysia </conf-loc>
</nlm-citation>
</ref>
<ref id="B14">
<label>[14]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guerriero]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Musmanno]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Pisacane]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Rende]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A mathematical model for the multi-levels product allocation problem in a warehouse with compatibility constraints]]></article-title>
<source><![CDATA[Applied Mathematical Modelling]]></source>
<year>2013</year>
<volume>37</volume>
<page-range>4385-98</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>[15]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Buil]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Piera]]></surname>
<given-names><![CDATA[M.A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Warehouse redesign to satisfy tight supply chain management constraints]]></article-title>
<source><![CDATA[WSEAS Transactions on Information Science and Applications]]></source>
<year>2008</year>
<volume>5</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>286-91</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>[16]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Roodbergen]]></surname>
<given-names><![CDATA[K.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Vis]]></surname>
<given-names><![CDATA[I.F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A model for warehouse layout]]></article-title>
<source><![CDATA[IIE Transactions]]></source>
<year>2006</year>
<volume>38</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>799-811</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>[17]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[J.C.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Shih]]></surname>
<given-names><![CDATA[P.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[M.H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Storage assignment problem with travel distance and blocking considerations for a picker-to-part order picking system]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2012</year>
<volume>62</volume>
<page-range>527-35</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>[18]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gagliardi]]></surname>
<given-names><![CDATA[J.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Renaud]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Models for automated storage and retrieval systems: a literature review]]></article-title>
<source><![CDATA[International Journal of Production Research]]></source>
<year>2012</year>
<volume>50</volume>
<page-range>7110-25</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>[19]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bottani]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Cecconi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Vignali]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Montanari]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimisation of storage allocation in order picking operations through a genetic algorithm]]></article-title>
<source><![CDATA[International Journal of Logistics Research and Applications: A Leading Journal of Supply Chain Management]]></source>
<year>2012</year>
<volume>15</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>127-46</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>[20]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Heragu]]></surname>
<given-names><![CDATA[S.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Du]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Mantel]]></surname>
<given-names><![CDATA[R.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Schuur]]></surname>
<given-names><![CDATA[P.C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mathematical model for warehouse design and product allocation]]></article-title>
<source><![CDATA[International Journal of Production Research]]></source>
<year>2005</year>
<volume>43</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>327-38</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>[21]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Faber]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[De Koster]]></surname>
<given-names><![CDATA[M.B.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Smidts]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Organizing warehouse management]]></article-title>
<source><![CDATA[International Journal of Operations and Production Management]]></source>
<year>2013</year>
<volume>33</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>1230-56</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>[22]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Roodbergen]]></surname>
<given-names><![CDATA[K.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Vis]]></surname>
<given-names><![CDATA[I.F.]]></given-names>
</name>
<name>
<surname><![CDATA[Taylor Jr]]></surname>
<given-names><![CDATA[G.D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simultaneous determination of warehouse layout and control policies]]></article-title>
<source><![CDATA[International Journal of Production Research]]></source>
<year>2015</year>
<volume>53</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>3306-26</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>[23]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Abdoli]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Kara]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Designing warehouse logical architecture by applying object oriented model based system engineering]]></article-title>
<source><![CDATA[Procedia CIRP]]></source>
<year>2016</year>
<volume>50</volume>
<page-range>713-8</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>[24]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Adarme]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Otero]]></surname>
<given-names><![CDATA[M.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodríguez]]></surname>
<given-names><![CDATA[T.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Tejeda]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimization of a warehouse layout used for storage of materials used in ship construction and repair]]></article-title>
<source><![CDATA[Ship Science &amp; Technology]]></source>
<year>2012</year>
<volume>5</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>59-70</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>[25]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Meller]]></surname>
<given-names><![CDATA[R.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Gue]]></surname>
<given-names><![CDATA[K.R]]></given-names>
</name>
</person-group>
<source><![CDATA[The application of new aisle design for unit-load warehouses]]></source>
<year>2009</year>
<conf-name><![CDATA[ 2009 NSF Engineering Research and Innovation Conference]]></conf-name>
<conf-loc>Honolulu, Hawaii </conf-loc>
<page-range>1-8</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>[26]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pohl]]></surname>
<given-names><![CDATA[L.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Meller]]></surname>
<given-names><![CDATA[R.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Gue]]></surname>
<given-names><![CDATA[K.R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An analysis of dual-command operations in common warehouse designs]]></article-title>
<source><![CDATA[Transportation Research Part E]]></source>
<year>2009</year>
<volume>45</volume>
<page-range>367-79</page-range></nlm-citation>
</ref>
<ref id="B27">
<label>[27]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cardona]]></surname>
<given-names><![CDATA[L.F.]]></given-names>
</name>
<name>
<surname><![CDATA[Rivera]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[H.J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Analytical study of the Fishbone warehouse layout]]></article-title>
<source><![CDATA[International Journal of Logistics Research and Applications: A Leading Journal of Supply Chain Management]]></source>
<year>2012</year>
<volume>15</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>365-88</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>[28]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[J.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[K.H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A grouped storage method for minimizing relocations in block stacking systems]]></article-title>
<source><![CDATA[Journal of Intelligent Manufacturing]]></source>
<year>2006</year>
<volume>17</volume>
<page-range>453-63</page-range></nlm-citation>
</ref>
<ref id="B29">
<label>[29]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Caserta]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Voss]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Sniedovich]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Applying the corridor method to a blocks relocation problem]]></article-title>
<source><![CDATA[OR Spectrum]]></source>
<year>2011</year>
<volume>33</volume>
<page-range>915-29</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>[30]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Caserta]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Schwarze]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Voss]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[A new binary description of the blocks relocation problem and benefits in a look ahead heuristic]]></source>
<year>2009</year>
<conf-name><![CDATA[ 9thEuropean Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP)]]></conf-name>
<conf-loc>Tubingen, Germany </conf-loc>
<page-range>37-48</page-range></nlm-citation>
</ref>
<ref id="B31">
<label>[31]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[K.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Hong]]></surname>
<given-names><![CDATA[G.P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A heuristic rule for relocating blocks]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2006</year>
<volume>33</volume>
<page-range>940-54</page-range></nlm-citation>
</ref>
<ref id="B32">
<label>[32]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Goetschalckx]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[McGinnis]]></surname>
<given-names><![CDATA[L.F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Research on warehouse design and performance evaluation: a comprehensive review]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2010</year>
<volume>203</volume>
<page-range>539-49</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>[33]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Staudt]]></surname>
<given-names><![CDATA[F.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Alpan]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Di Mascolo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodriguez]]></surname>
<given-names><![CDATA[C.M.T]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Warehouse performance measurement: a literature review]]></article-title>
<source><![CDATA[International Journal of Production Research]]></source>
<year>2015</year>
<volume>53</volume>
<numero>18</numero>
<issue>18</issue>
<page-range>5524-44</page-range></nlm-citation>
</ref>
<ref id="B34">
<label>[34]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Staudt]]></surname>
<given-names><![CDATA[F.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Di Mascolo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Alpan]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodriguez]]></surname>
<given-names><![CDATA[C.M.T]]></given-names>
</name>
</person-group>
<source><![CDATA[Warehouse performance measurement: classification and mathematical expressions of indicators]]></source>
<year>2014</year>
<conf-name><![CDATA[ 5thInternational Conference Information Systems, Logistics and Supply Chain]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B35">
<label>[35]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ene]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Öztürk]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Storage location assignment and order picking optimization in the automotive industry]]></article-title>
<source><![CDATA[The International Journal of Advanced Manufacturing Technology]]></source>
<year>2012</year>
<volume>60</volume>
<numero>5-8</numero>
<issue>5-8</issue>
<page-range>787-97</page-range></nlm-citation>
</ref>
<ref id="B36">
<label>[36]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[G.Y.H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new data structure of solution representation in hybrid ant colony optimization for large dynamic facility layout problems]]></article-title>
<source><![CDATA[International Journal of Production Economics]]></source>
<year>2013</year>
<volume>142</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>362-71</page-range></nlm-citation>
</ref>
<ref id="B37">
<label>[37]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Makaci]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Reaidy]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Evrard-Samuel]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Botta-Genoulaz]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Monteiro]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Pooled warehouse management: an empirical study]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2017</year>
<volume>112</volume>
<page-range>526-36</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
