<?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>0123-921X</journal-id>
<journal-title><![CDATA[Tecnura]]></journal-title>
<abbrev-journal-title><![CDATA[Tecnura]]></abbrev-journal-title>
<issn>0123-921X</issn>
<publisher>
<publisher-name><![CDATA[Universidad Distrital Francisco José de Caldas]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0123-921X2022000400035</article-id>
<article-id pub-id-type="doi">10.14483/22487638.17731</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Firefly Algorithm for Facility Layout Optimization]]></article-title>
<article-title xml:lang="es"><![CDATA[Algoritmo luciérnaga para la optimización de distribución en planta]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Vargas-Pardo]]></surname>
<given-names><![CDATA[Luisa Fernanda]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Giraldo-Ramos]]></surname>
<given-names><![CDATA[Frank Nixon]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Distrital Francisco José de Caldas  ]]></institution>
<addr-line><![CDATA[Bogotá ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Distrital Francisco José de Caldas  ]]></institution>
<addr-line><![CDATA[Bogotá ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2022</year>
</pub-date>
<volume>26</volume>
<numero>74</numero>
<fpage>35</fpage>
<lpage>48</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0123-921X2022000400035&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0123-921X2022000400035&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0123-921X2022000400035&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT  Objective: This paper presents a review of the results obtained by an optimization methodology based on the application of the firefly algorithm (FA) as a metaheuristic planning tool with the purpose of finding the optimal facility layout in order to reduce the distances and flow times between processes of the production chain.  Methodology: By means of implementing the MATLAB script, the goal was to evaluate the FA as applied to the facility layout distribution optimization problem, conducting a test of two facility layout cases with the algorithm. The FA was applied in order to evaluate the performance with respect to the initial facility layout configuration, as well as in comparison with a conventional heuristic algorithm.  Results: The most relevant result was the verification of the FA&#8217;s degree of efficiency regarding the convergence time, as expressed in terms of the number of cycles required to reach an optimal solution in comparison with the conventional heuristic algorithm used for validation.  Conclusions: The total optimized distance in the plant achieves a low significant value. A reduced number of iterations is required to reach an optimal value in the case of a complex facility layout.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN  Objetivo: Este artículo presenta una revisión de los resultados de una metodología de optimización enfocada en la aplicación del algoritmo de luciérnaga (FA) como una herramienta de planificación metaheurística con el fin de encontrar una distribución en planta óptima para reducir las distancias y los tiempos de flujo de procesos en la cadena de producción.  Metodología: A través de la implementación del script de MATLAB, el objetivo fue evaluar el FA aplicado al problema de optimización de diseño de distribución en planta, realizando una prueba de dos casos de diseño de instalaciones con el algoritmo. Se aplicó el FA para evaluar el rendimiento con respecto a la configuración inicial de distribución en planta, así como en contraste con un algoritmo heurístico convencional.  Resultados: El resultado más relevante fue la verificación del grado de eficiencia del FA con respecto al tiempo de convergencia, expresado en función de la cantidad de ciclos requeridos para alcanzar una solución óptima, en comparación con el algoritmo heurístico convencional utilizado para la validación.  Conclusiones: La distancia total optimizada en la planta logra un valor bajo significativo. Se requiere un número reducido de iteraciones para alcanzar un valor óptimo en el caso de una distribución en planta compleja.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[facility layout problem]]></kwd>
<kwd lng="en"><![CDATA[firefly optimization]]></kwd>
<kwd lng="en"><![CDATA[metaheuristics]]></kwd>
<kwd lng="en"><![CDATA[combinatorial optimization]]></kwd>
<kwd lng="es"><![CDATA[problema de distribución en planta]]></kwd>
<kwd lng="es"><![CDATA[algoritmo luciérnaga]]></kwd>
<kwd lng="es"><![CDATA[metaheurística]]></kwd>
<kwd lng="es"><![CDATA[optimización combinacional]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dey]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<source><![CDATA[Applications of firefly algorithm and its variants]]></source>
<year>2020</year>
<publisher-name><![CDATA[Springer Singapore]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dhillon]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Goyal]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[PAPR reduction in multicarrier modulations using firefly algorithm]]></article-title>
<source><![CDATA[International Journal of Innovative Research in Computer and Communication Engineering]]></source>
<year>2013</year>
<volume>1</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1270-5</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hernández-Santibáñez]]></surname>
<given-names><![CDATA[L. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Gaviria-Ramírez.]]></surname>
<given-names><![CDATA[A. M.,]]></given-names>
</name>
<name>
<surname><![CDATA[Osorio-Gómez]]></surname>
<given-names><![CDATA[J. C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Priorización de despachos con AHP difuso y Topsis]]></article-title>
<source><![CDATA[Revista Tecnura]]></source>
<year>2017</year>
<volume>21</volume>
<numero>52</numero>
<issue>52</issue>
<page-range>102-10</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jara-Estupiñan]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Hernández-Suárez]]></surname>
<given-names><![CDATA[C. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Giral-Ramírez]]></surname>
<given-names><![CDATA[D. A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimal value of past samples for decision making in cognitive radio networks]]></article-title>
<source><![CDATA[Revista Tecnura]]></source>
<year>2020</year>
<volume>24</volume>
<numero>65</numero>
<issue>65</issue>
<page-range>13-26</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jati]]></surname>
<given-names><![CDATA[G. K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Evolutionary discrete firefly algorithm for travelling salesman problem. In International conference on adaptive and intelligent systems]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Bouchachia]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Adaptive and Intelligent Systems]]></source>
<year>2011</year>
<page-range>393-403</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A systematic review on firefly algorithm: Past, present, and future]]></article-title>
<source><![CDATA[Archives of Computational Methods in Engineering]]></source>
<year>2021</year>
<volume>28</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>3269-91</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kumbharana]]></surname>
<given-names><![CDATA[S. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Pandey]]></surname>
<given-names><![CDATA[G. M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving travelling salesman problem using firefly algorithm]]></article-title>
<source><![CDATA[International Journal for Research in Science &amp; Advanced Technologies]]></source>
<year>2013</year>
<volume>2</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>53-7</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[&#321;ukasik]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[&#379;ak]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Firefly algorithm for continuous constrained optimization tasks]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Nguyen]]></surname>
<given-names><![CDATA[N. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Kowalczyk]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[S.-M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems]]></source>
<year>2009</year>
<page-range>97-106</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Patle]]></surname>
<given-names><![CDATA[B. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Pandey]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Jagadeesh]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Parhi]]></surname>
<given-names><![CDATA[D. R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Path planning in uncertain environment by using firefly algorithm]]></article-title>
<source><![CDATA[Defence Technology]]></source>
<year>2018</year>
<volume>14</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>691-701</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Quiroga]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Cáceres]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Padilla]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimización de trayectorias de fresado en cavidades utilizando el algoritmo Luciérnaga]]></article-title>
<source><![CDATA[Revista de la Facultad de Ingeniería Universidad Central de Venezuela]]></source>
<year>2015</year>
<volume>30</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>93-104</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ramírez-Ramírez]]></surname>
<given-names><![CDATA[J. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Arrieta-Giraldo]]></surname>
<given-names><![CDATA[J. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Garcés-Ruiz]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Distribución óptima de turbinas en parques eólicos mediante PSO considerando el efecto sombra.]]></article-title>
<source><![CDATA[Revista Tecnura]]></source>
<year>2016</year>
<volume>20</volume>
<numero>47</numero>
<issue>47</issue>
<page-range>49-55</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Saraei]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Analouei]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Mansouri]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving of travelling salesman problem using firefly algorithm with greedy approach]]></article-title>
<source><![CDATA[Cumhuriyet Üniversitesi Fen Fakültesi Fen Bilimleri Dergisi (CFD)]]></source>
<year>2015</year>
<volume>36</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>267-73</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Solarte]]></surname>
<given-names><![CDATA[G. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Soto-Mejía]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Muñoz-Guerrero]]></surname>
<given-names><![CDATA[L. E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Localización del punto óptimo de partida en el problema de ruteo vehicular con capacidad restringida (CVRP)]]></article-title>
<source><![CDATA[Revista Tecnura]]></source>
<year>2018</year>
<volume>23</volume>
<numero>59</numero>
<issue>59</issue>
<page-range>27-46</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Trachanatzi]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Rigakis]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Marinaki]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Marinakis]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A firefly algorithm for the environmental prize-collecting vehicle routing problem]]></article-title>
<source><![CDATA[Swarm and Evolutionary Computation]]></source>
<year>2020</year>
<numero>57</numero>
<issue>57</issue>
<page-range>100712</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[X. S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multiobjective firefly algorithm for continuous optimization]]></article-title>
<source><![CDATA[Engineering with Computers]]></source>
<year>2013</year>
<volume>29</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>175-84</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Burrage]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Tian]]></surname>
<given-names><![CDATA[Y. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Lawson]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Ding]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved firefly algorithm for global continuous optimization problems]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2020</year>
<numero>149</numero>
<issue>149</issue>
<page-range>113340</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
