<?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>2007-0705</journal-id>
<journal-title><![CDATA[Nova scientia]]></journal-title>
<abbrev-journal-title><![CDATA[Nova scientia]]></abbrev-journal-title>
<issn>2007-0705</issn>
<publisher>
<publisher-name><![CDATA[Universidad de La Salle Bajío A. C., Coordinación de Investigación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S2007-07052017000200329</article-id>
<article-id pub-id-type="doi">10.21640/ns.v9i19.1105</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Ubicación óptima de unidades de servicio bajo condiciones de capacidad limitada mediante un método metaheurístico]]></article-title>
<article-title xml:lang="en"><![CDATA[Optimal location of capacitated service units through a metaheuristic optimization approach]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ríos Mercado]]></surname>
<given-names><![CDATA[Roger Z.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Quevedo Orozco]]></surname>
<given-names><![CDATA[Dagoberto R.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Autónoma de Nuevo León Facultad de Ingeniería Mecánica y Eléctrica Programa de Posgrado en Ingeniería de Sistemas]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,SINTEC  ]]></institution>
<addr-line><![CDATA[San Pedro Nuevo León]]></addr-line>
<country>México</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>00</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>00</month>
<year>2017</year>
</pub-date>
<volume>9</volume>
<numero>19</numero>
<fpage>329</fpage>
<lpage>347</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S2007-07052017000200329&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S2007-07052017000200329&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S2007-07052017000200329&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen  Introducción:  El problema de localización de p-centro capacitado consiste en ubicar p instalaciones y asignar usuarios a cada una de ellas, de tal manera que se minimice la distancia máxima entre cualquier usuario y su instalación asignada, sujeto a la capacidad en la demanda restringida por cada instalación. Este trabajo propone una metodología heurística para la solución del problema; los resultados de la experimentación demuestran la calidad de la heurística propuesta en relación con los métodos existentes en la literatura.  Método:  Se propone una metodología heurística para la solución de este problema, la cual integra varios componentes, tales como un método voraz-adaptativo con una selección probabilística, búsqueda local voraz iterada y una búsqueda descendente por entornos variables.  Resultados:  La evidencia empírica sobre un conjunto de instancias de localización usualmente utilizadas en la literatura, revela el impacto positivo de cada uno de los componentes desarrollados y de la calidad de la heurística propuesta en relación con los métodos existentes. Por ejemplo, la heurística propuesta pudo encontrar soluciones factibles a todas las instancias probadas, excepto a dos; mientras que el mejor de los otros tres métodos probados falló en 18 de las instancias.  Conclusión:  Se encontró empíricamente que la heurística propuesta supera a la mejor heurística existente para este problema en términos de calidad de la solución, tiempo de ejecución y confiabilidad en la búsqueda de soluciones factibles en instancias difíciles.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract  Introduction: The capacitated vertex p-center problem is a location problem that consists of placing p facilities and assigning customers to each of these facilities so as to minimize the maximum distance between any customer and its assigned facility, subject to demand capacity constraints for each facility.  Method:  In this work, a metaheuristic for this location problem is presented. It integrates several components such as a greedy randomized construction with an adaptive probabilistic sampling scheme and an iterated greedy local search with variable neighborhood descent.  Results:  Empirical evidence over a widely used set of benchmark instances on location literature, reveals the positive impact of each of the developed components and the quality of the solutions delivered by the heuristic when compared with existing methods. For instance, the proposed heuristic was able to find feasible solutions to all but two instances, while the best of the existing methods failed in 18 of these instances.  Conclusion:  It is found empirically that the proposed heuristic outperforms the best existing heuristic for this problem in terms of solution quality, running time, and reliability on finding feasible solutions for hard instances.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[investigación de operaciones]]></kwd>
<kwd lng="es"><![CDATA[optimización combinatoria]]></kwd>
<kwd lng="es"><![CDATA[localización discreta]]></kwd>
<kwd lng="es"><![CDATA[problema de p-centro capacitado]]></kwd>
<kwd lng="es"><![CDATA[metaheurísticas]]></kwd>
<kwd lng="en"><![CDATA[operations research]]></kwd>
<kwd lng="en"><![CDATA[combinatorial optimization]]></kwd>
<kwd lng="en"><![CDATA[discrete location]]></kwd>
<kwd lng="en"><![CDATA[capacitated p-center problem]]></kwd>
<kwd lng="en"><![CDATA[metaheuristics]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Lagrangean duals and exact solution to the capacitated p-center problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Albareda-Sambola]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Díaz]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Fernández]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2010</year>
<volume>201</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>71-81</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[OR-Library: Distributing test problems by electronic mail]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Beasley]]></surname>
<given-names><![CDATA[J.E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>1990</year>
<volume>41</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>1069-72</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A branch-and-price algorithm for the capacitated p-median problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ceselli]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Righini]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Networks]]></source>
<year>2005</year>
<volume>45</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>125-42</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A new formulation and resolution method for the p-center problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Elloumi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Labbé]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Pochet]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[INFORMS Journal on Computing]]></source>
<year>2004</year>
<volume>16</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>84-94</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Farahani]]></surname>
<given-names><![CDATA[R.Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Hekmatfar]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Facility Location: Concepts, Models, Algorithms and Case Studies]]></source>
<year>2009</year>
<publisher-loc><![CDATA[Heidelberg, Alemania ]]></publisher-loc>
<publisher-name><![CDATA[Physica-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Iterated greedy local search methods for unrelated parallel machine scheduling]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fanjul-Peyro]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2010</year>
<volume>207</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>55-69</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Greedy randomized adaptive search procedures]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Feo]]></surname>
<given-names><![CDATA[T.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Resende]]></surname>
<given-names><![CDATA[M.G.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of Global Optimization]]></source>
<year>1995</year>
<volume>6</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>109-33</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hansen]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Mladenovi&#263;]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An introduction to variable neighborhood search]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Voß]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Martello]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Osman]]></surname>
<given-names><![CDATA[I.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Roucairol]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization]]></source>
<year>1999</year>
<page-range>433-58</page-range><publisher-loc><![CDATA[Kluwer, Boston, EUA ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An iterated greedy heuristic for a market segmentation problem with multiple attributes]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Huerta-Muñoz]]></surname>
<given-names><![CDATA[D.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Ríos-Mercado]]></surname>
<given-names><![CDATA[R.Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2017</year>
<volume>261</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>75-87</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An algorithmic approach to network location problems, I: The p-centers]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kariv]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Hakimi]]></surname>
<given-names><![CDATA[S.L.]]></given-names>
</name>
</person-group>
<source><![CDATA[SIAM Journal of Applied Mathematics]]></source>
<year>1979</year>
<volume>37</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>513-38</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Loosemore]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Stallman]]></surname>
<given-names><![CDATA[R.M.]]></given-names>
</name>
<name>
<surname><![CDATA[McGrath]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Oram]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Drepper]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
</person-group>
<source><![CDATA[The GNU C Library Reference Manual: For version 2.17]]></source>
<year>2012</year>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A column generation approach to capacitated p-median problems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lorena]]></surname>
<given-names><![CDATA[L.A.N.]]></given-names>
</name>
<name>
<surname><![CDATA[Senne]]></surname>
<given-names><![CDATA[E.L.F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2004</year>
<volume>31</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>863-76</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lourenço]]></surname>
<given-names><![CDATA[H.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Martin]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Stützle]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Iterated local search]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Glover F]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Kochenberger]]></surname>
<given-names><![CDATA[G.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of Metaheuristics]]></source>
<year>2002</year>
<page-range>321-53</page-range><publisher-loc><![CDATA[Kluwer, Boston, EUA ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martins]]></surname>
<given-names><![CDATA[A.X.]]></given-names>
</name>
<name>
<surname><![CDATA[Duhamel]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Souza]]></surname>
<given-names><![CDATA[M.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Saldanha]]></surname>
<given-names><![CDATA[R.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Mahey]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A VND-ILS heuristic to solve the RWA problem]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Pahl]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Reiners]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Voß]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Network Optimization]]></source>
<year>2011</year>
<volume>6701</volume>
<page-range>577-82</page-range><publisher-loc><![CDATA[Springer, Berlin, Alemania ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An exact algorithm for the capacitated vertex p-center problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Özsoy]]></surname>
<given-names><![CDATA[F.A.]]></given-names>
</name>
<name>
<surname><![CDATA[P&#305;nar]]></surname>
<given-names><![CDATA[M.Ç.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2006</year>
<volume>33</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1420-36</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Improving the quality of heuristic solutions for the capacitated vertex p-center problem through iterated greedy local search with variable neighborhood descent]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Quevedo-Orozco]]></surname>
<given-names><![CDATA[D.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Ríos-Mercado]]></surname>
<given-names><![CDATA[R.Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2015</year>
<volume>62</volume>
<page-range>133-44</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reinelt]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Traveling Salesman: Computational Solutions for TSP Applications]]></source>
<year>1994</year>
<publisher-loc><![CDATA[Springer, Heidelberg, Alemania ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A lagrangean heuristic for the maximal covering location problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Galvão]]></surname>
<given-names><![CDATA[R. D.]]></given-names>
</name>
<name>
<surname><![CDATA[ReVelle]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>1996</year>
<volume>88</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>114-23</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[GRASP with path relinking for commercial districting]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ríos-Mercado]]></surname>
<given-names><![CDATA[R.Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Escalante]]></surname>
<given-names><![CDATA[H.J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2016</year>
<volume>44</volume>
<page-range>102-13</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A reactive GRASP for a commercial territory design problem with multiple balancing requirements]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ríos-Mercado]]></surname>
<given-names><![CDATA[R.Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Fernández]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2009</year>
<volume>36</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>755-76</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Stützle]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2007</year>
<volume>177</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>2033-49</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Stützle]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2008</year>
<volume>187</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>1143-59</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Large-scale local search heuristics for the capacitated vertex p-center problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Scaparra]]></surname>
<given-names><![CDATA[M.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Pallottino]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Scutellà]]></surname>
<given-names><![CDATA[M.G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Networks]]></source>
<year>2004</year>
<volume>43</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>241-55</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Subramanian]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Drummond]]></surname>
<given-names><![CDATA[L.M.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Bentes]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Ochi]]></surname>
<given-names><![CDATA[L.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Farias]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2010</year>
<volume>37</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>1899-911</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Shifting representation search for hybrid flexible flowline problems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Urlings]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Stu&#776;tzle]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2010</year>
<volume>207</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>1086-95</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
