<?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>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462022000100271</article-id>
<article-id pub-id-type="doi">10.13053/cys-26-1-4170</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[GRASP Proposal for the Search for SQAP Solutions]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[González Velázquez]]></surname>
<given-names><![CDATA[Rogelio]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Granillo Martínez]]></surname>
<given-names><![CDATA[Érika]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Bernabé Loranca]]></surname>
<given-names><![CDATA[M. Beatriz]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Powell- González]]></surname>
<given-names><![CDATA[Jairo E.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Benemérita Universidad Autónoma de Puebla Facultad de Ciencias de la Computación ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Benemérita Universidad Autónoma de Puebla Facultad de Administración ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2022</year>
</pub-date>
<volume>26</volume>
<numero>1</numero>
<fpage>271</fpage>
<lpage>279</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462022000100271&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462022000100271&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462022000100271&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: The Quadratic Assignment Problem (QAP) consists of finding an optimal allocation of n facilities to n locations in such a way as to minimize the cost of interaction between facilities. The QAP is considered as a NP-hard. This article presents an application of QAP that consists of modeling a traffic system by introducing a probability transition matrix to transform the QAP into the Stochastic Quadratic Assignment Problem (SQAP). The objective of this article is to find solutions for SQAP through the implementation of the metaheuristic Greedy Randomized Adaptive Search Procedure (GRASP), in the JAVA programming language. The program is executed for a set of test instances and the results obtained by the application of two search strategies that make four combinations in the construction phases and the post processing phases of the metaheuristics. The program was also executed for a problem that presents instances of size n = 12 to 30, whose optimal solution is given. Given the need to offer solutions to logistics problems of the NP-hard class, a tool for approximating the optimal solutions is presented.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Metaheuristics]]></kwd>
<kwd lng="en"><![CDATA[GRASP]]></kwd>
<kwd lng="en"><![CDATA[QAP]]></kwd>
<kwd lng="en"><![CDATA[SQAP]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aiex]]></surname>
<given-names><![CDATA[R.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Resendes]]></surname>
<given-names><![CDATA[M.G.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Ribeiro]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Probability distribution of solution time in GRASP: an experimental Investigation]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>2002</year>
<volume>8</volume>
<page-range>343-73</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Díaz]]></surname>
<given-names><![CDATA[A.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Glober]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Ghaziri]]></surname>
<given-names><![CDATA[H.M.]]></given-names>
</name>
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[J.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Moscato]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Tseng]]></surname>
<given-names><![CDATA[F.T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimización Heurística y Redes Neuronales en Dirección de Operaciones e Ingeniería]]></source>
<year>1996</year>
<publisher-loc><![CDATA[Madrid ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[EK.]]></given-names>
</name>
<name>
<surname><![CDATA[Kendall]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Search Methodologies: Introductory Tutorial in optimization and Decision Support Techniques]]></source>
<year>2014</year>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cela]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Quadratic assignment problem: special cases and relatives]]></source>
<year>1995</year>
<publisher-loc><![CDATA[Graz Austria ]]></publisher-loc>
<publisher-name><![CDATA[Institut für Mathematik B Technische Iniversität Graz]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chmiel]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Kad&#322;uczka]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Kwiecie&#324;]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Filipowicz]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A comparison of nature inspired algorithms for the quadratic assignment problem]]></article-title>
<source><![CDATA[Bulletin of the Polish Academy of Sciences. Technical Sciences]]></source>
<year>2017</year>
<volume>65</volume>
<numero>4</numero>
<issue>4</issue>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dokeroglu]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Sevinc]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Cosar]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Artificial bee colony optimization for the quadratic assignment problem]]></article-title>
<source><![CDATA[Applied Soft Computing Journal]]></source>
<year>2019</year>
<volume>76</volume>
<page-range>595-606</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Duque]]></surname>
<given-names><![CDATA[P.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sörensen]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A GRASP Metahueristic to improve accessibility after a disaster]]></article-title>
<source><![CDATA[OR Spectrum]]></source>
<year>2011</year>
<volume>33</volume>
<page-range>525-42</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Essafi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Delorme]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Dolgui]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A reactive GRASP and path relinking for balancing reconfiguration transfer lines]]></article-title>
<source><![CDATA[International Journal of Production Research]]></source>
<year>2012</year>
<volume>50</volume>
<numero>18</numero>
<issue>18</issue>
<page-range>5213-38</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Festa]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Resende]]></surname>
<given-names><![CDATA[M.G.]]></given-names>
</name>
<name>
<surname><![CDATA[Hansen]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Riveiro]]></surname>
<given-names><![CDATA[C.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[GRASP: An annotated Bibliography. Ensays and Surveys on Metaheuristics]]></source>
<year>2000</year>
<publisher-name><![CDATA[Kluwer Academic Publihers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Granillo]]></surname>
<given-names><![CDATA[M.E.]]></given-names>
</name>
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[V.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Bernabé]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[F.J.L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Neighborhood Combining Approach in GRASP´s Local Search for Quadratic Assignment Problem Solutions]]></article-title>
<source><![CDATA[Computación y Sistemas]]></source>
<year>2018</year>
<volume>22</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>179-87</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Koopmans]]></surname>
<given-names><![CDATA[T.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Beckmann]]></surname>
<given-names><![CDATA[M.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Assignment problems and the location of economic activities]]></article-title>
<source><![CDATA[Econometrica]]></source>
<year>1957</year>
<volume>25</volume>
<page-range>53-76</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sahu]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mitra]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A comparison of different metaheuristics for the quadratic assignment problem in accelerated systems]]></article-title>
<source><![CDATA[Applied Soft Computing Journal]]></source>
<year>2021</year>
<volume>100</volume>
<page-range>1-16</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Loiola]]></surname>
<given-names><![CDATA[E.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Maia de Abreu]]></surname>
<given-names><![CDATA[N.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Boaventura]]></surname>
<given-names><![CDATA[P.O.]]></given-names>
</name>
<name>
<surname><![CDATA[Hahn]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Tania-Querido]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey for the quadratic assignment problem]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2007</year>
<volume>176</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>657-90</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Pardalos]]></surname>
<given-names><![CDATA[P.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Resende]]></surname>
<given-names><![CDATA[M.G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A greedy randomized adaptative search procedure for the quadratic assignment problem]]></article-title>
<source><![CDATA[DIMACS Series on Discrete Mathematics and Theoretical Computer Sience]]></source>
<year>1994</year>
<volume>16</volume>
<page-range>37-261</page-range><publisher-name><![CDATA[American Mathematical Society]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Macgregor]]></surname>
<given-names><![CDATA[W.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Stochastic quadratic assignment problems]]></article-title>
<source><![CDATA[DIMACS Series on Discrete Mathematics and Theoretical Science]]></source>
<year>1993</year>
<volume>16</volume>
<page-range>221-36</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Macgregor]]></surname>
<given-names><![CDATA[W.J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Quadratic assignment problems and M/G/C/C state dependent network flows]]></article-title>
<source><![CDATA[Journal Combinatorial Optimization]]></source>
<year>2001</year>
<volume>1</volume>
<page-range>421-43</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Pardalos]]></surname>
<given-names><![CDATA[P.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Resende]]></surname>
<given-names><![CDATA[M.G.C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A greedy randomized adaptative search procedure for the quadratic assignment problem]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Pardalos]]></surname>
<given-names><![CDATA[P.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Wolkowicz]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[DIMACS Series on Discrete Mathematics and Theoretical Computer Science]]></source>
<year>1994</year>
<volume>16</volume>
<page-range>237-61</page-range><publisher-name><![CDATA[American Mathematical Society]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mishmast]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Gelareh]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey of meta-heuristic solution methods for the quadratic assignment problem]]></article-title>
<source><![CDATA[Applied Mathematical Sciences]]></source>
<year>2007</year>
<volume>46</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>2293-312</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pardalos]]></surname>
<given-names><![CDATA[P.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Pitssoulis]]></surname>
<given-names><![CDATA[L.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Resende]]></surname>
<given-names><![CDATA[M.G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Parallel GRASP implementation for the quadratic assignment problem]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Ferreira]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Rolim]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Parallel Algorithms for Irregularly Structured Problems]]></source>
<year>1995</year>
<volume>94</volume>
<page-range>111-30</page-range><publisher-name><![CDATA[Klower Academic Publishers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="">
<collab>QAPLIB</collab>
<source><![CDATA[]]></source>
<year>2020</year>
</nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Resende]]></surname>
<given-names><![CDATA[M.G.]]></given-names>
</name>
<name>
<surname><![CDATA[Pardalos]]></surname>
<given-names><![CDATA[P.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problem using GRASP]]></article-title>
<source><![CDATA[ACM Transactions on mathematical software]]></source>
<year>1996</year>
<volume>22</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>104-18</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ribeiro]]></surname>
<given-names><![CDATA[C.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Rosseti]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Souza]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Probabilistic stopping rules for GRASP heuristics and extensions]]></article-title>
<source><![CDATA[Intl. Trans. In Op. Re.]]></source>
<year>2013</year>
<volume>20</volume>
<page-range>302-23</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Roucairol]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A parallel branch and bound algorithm for the quadratic assignment problem]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>1987</year>
<volume>18</volume>
<page-range>211-25</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sahni]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[P-complete aproximations problems]]></article-title>
<source><![CDATA[J. Assoc. Comp. Machine]]></source>
<year>1976</year>
<volume>23</volume>
<page-range>555-65</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shen]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Chu]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[MC.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multi-mode transportation planning of crude oil via Greedy Randomized Adaptive Search and Path Relinking]]></article-title>
<source><![CDATA[Transactions of the Institute of Measurement and Control]]></source>
<year>2011</year>
<volume>33</volume>
<numero>3/4</numero>
<issue>3/4</issue>
<page-range>456-75</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Skorin-Kapov]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tabu applied to the quadratic assignment problem]]></article-title>
<source><![CDATA[ORSA Journal on Computing]]></source>
<year>1990</year>
<volume>2</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>33-45</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tosun]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new recombination operator for the genetic algorithm solution of the quadratic assignment problem]]></article-title>
<source><![CDATA[Procedia Computer Science]]></source>
<year>2014</year>
<volume>32</volume>
<page-range>29-36</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
