<?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>1909-8367</journal-id>
<journal-title><![CDATA[Entre Ciencia e Ingeniería]]></journal-title>
<abbrev-journal-title><![CDATA[Entre Ciencia e Ingenieria]]></abbrev-journal-title>
<issn>1909-8367</issn>
<publisher>
<publisher-name><![CDATA[Universidad Católica de Pereira]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1909-83672018000100103</article-id>
<article-id pub-id-type="doi">10.31908/19098367.3709</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Hiperheurística para el planeamiento del transporte público]]></article-title>
<article-title xml:lang="en"><![CDATA[Hyperheuristics for public transport planning]]></article-title>
<article-title xml:lang="pt"><![CDATA[Hiperheurística para o planejamento do transporte público]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rodríguez]]></surname>
<given-names><![CDATA[D. A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Oteiza]]></surname>
<given-names><![CDATA[P. P.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Brignole]]></surname>
<given-names><![CDATA[N. B.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Nacional de Salta  ]]></institution>
<addr-line><![CDATA[Salta ]]></addr-line>
<country>Argentina</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Nacional del Sur-CONICET  ]]></institution>
<addr-line><![CDATA[Bahía Blanca ]]></addr-line>
<country>Argentina</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Nacional del Sur-CONICET  ]]></institution>
<addr-line><![CDATA[Bahía Blanca ]]></addr-line>
<country>Argentina</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2018</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2018</year>
</pub-date>
<volume>12</volume>
<numero>23</numero>
<fpage>103</fpage>
<lpage>108</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S1909-83672018000100103&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S1909-83672018000100103&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S1909-83672018000100103&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen: Este artículo presenta un algoritmo que establece paradas y rutas de autobuses para extender líneas de transporte existentes. El algoritmo desarrollado se basa en una híperheurística, cuya característica principal es su capacidad para seleccionar y aplicar las metaheurísticas más convenientes en las diferentes etapas del proceso de búsqueda. Además, se muestra cómo se reducen los tiempos computacionales mediante programación paralela y una estrategia para minimizar el número de evaluaciones. El caso de estudio analizado surge de una necesidad existente en la ciudad de Bahía Blanca (Argentina), donde los vecinos han solicitado que el servicio de transporte público sea más accesible.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: This article presents an algorithm that establishes stops and routes for buses to extend the existing transport lines. The newly developed algorithm is based on a hyperheuristic approach, whose main feature is its ability to choose and apply the most convenient metaheuristics at the different stages of the search process. Besides, it is shown how computing times are reduced using parallel programming and through a strategy that minimizes the number of evaluations. The case under study arises from an existing need in Bahia Blanca city (Argentina), where the neighbors have asked for more accessibility in the public transport service.]]></p></abstract>
<abstract abstract-type="short" xml:lang="pt"><p><![CDATA[Resumo: Este artigo apresenta um algoritmo que estabelecem paradas e rotas de ônibus para ampliar as linhas de transporte existentes. O algoritmo desenvolvido baseia-se em uma hiperheurística, cuja principal característica é a sua capacidade de selecionar e aplicar as metaheurísticas mais convenientes nos diferentes estágios do processo de busca. Além disso, mostra como os tempos computacionais são reduzidos pela programação paralela e uma estratégia para minimizar o número de avaliações. O estudo de caso analisado decorre de uma necessidade existente na cidade de Bahía Blanca (Argentina), onde os residentes solicitaram que o serviço de transporte público seja mais acessível.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Transporte público]]></kwd>
<kwd lng="es"><![CDATA[hiperheurísticas]]></kwd>
<kwd lng="es"><![CDATA[optimización]]></kwd>
<kwd lng="es"><![CDATA[problema de localización y ruteo]]></kwd>
<kwd lng="en"><![CDATA[Public transport]]></kwd>
<kwd lng="en"><![CDATA[hyperheuristics]]></kwd>
<kwd lng="en"><![CDATA[optimization]]></kwd>
<kwd lng="en"><![CDATA[location and routing problem]]></kwd>
<kwd lng="pt"><![CDATA[Problema de transporte público]]></kwd>
<kwd lng="pt"><![CDATA[hiperheurísticas]]></kwd>
<kwd lng="pt"><![CDATA[otimização]]></kwd>
<kwd lng="pt"><![CDATA[localização e roteamento]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>[1]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Garau]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Masala]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Pinna]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Cagliari and smart urban mobility: Analysis and comparison]]></article-title>
<source><![CDATA[Cities]]></source>
<year>2016</year>
<volume>56</volume>
<page-range>35-46</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>[2]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Prodhon]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey of recent research on location-routing problems]]></article-title>
<source><![CDATA[Eur. J. Oper. Res.]]></source>
<year>2014</year>
<volume>238</volume>
<page-range>1-17</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[Chandra Mohan]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Baskaran]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey: Ant Colony Optimization based recent research and implementation on several engineering domain]]></article-title>
<source><![CDATA[Expert. Syst. Appl.]]></source>
<year>2012</year>
<volume>39</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>4618-27</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[Nagy]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Salhi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Location-routing: Issues, models and methods]]></article-title>
<source><![CDATA[Eur. J. Oper. Res]]></source>
<year>2007</year>
<volume>177</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>649-72</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[Wolsey]]></surname>
<given-names><![CDATA[L. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Integer programming]]></article-title>
<source><![CDATA[IIE Transactions]]></source>
<year>2000</year>
<volume>32</volume>
<page-range>273-85</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[Lenstra]]></surname>
<given-names><![CDATA[J. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Kan]]></surname>
<given-names><![CDATA[A. H. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Complexity of vehicle routing and scheduling problems]]></article-title>
<source><![CDATA[Networks]]></source>
<year>1981</year>
<volume>11</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>221-7</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[Sörensen]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Metaheuristics - the metaphor exposed,]]></article-title>
<source><![CDATA[Int. T. Oper. Res.]]></source>
<year>2013</year>
<volume>00</volume>
<page-range>1-16</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[Boussaïd]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Lepagnot]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Siarry]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey on optimization metaheuristics]]></article-title>
<source><![CDATA[Inf. Sci]]></source>
<year>2013</year>
<volume>237</volume>
<page-range>82-117</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[Wolpert]]></surname>
<given-names><![CDATA[D. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Macready]]></surname>
<given-names><![CDATA[W. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[No free lunch theorems for optimization]]></article-title>
<source><![CDATA[Evol. Comput, in IEEE Transactions]]></source>
<year>1997</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>67-82</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[Cowling]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Kendall]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Soubeiga]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hyperheuristic approach to scheduling a sales summit]]></article-title>
<source><![CDATA[Practice and Theory of Automated Timetabling III (Springer Berlin Heidelberg),]]></source>
<year>2001</year>
<page-range>176-90</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>[11]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Kendall]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Newall]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Hart]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ross]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Schulenburg]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hyper-heuristics: An emerging direction in modern search technology]]></article-title>
<source><![CDATA[Handbook of metaheuristics, Springer US]]></source>
<year>2003</year>
<page-range>457-74</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[Ross]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hyper-heuristics]]></article-title>
<source><![CDATA[Search methodologies]]></source>
<year>2005</year>
<page-range>529-56</page-range><publisher-name><![CDATA[Springer US]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>[13]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[E.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Gendreau]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hyde]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kendall]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Ochoa]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Özcan]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Qu]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hyper-heuristics: A survey of the state of the art]]></article-title>
<source><![CDATA[J. Oper. Res. Soc]]></source>
<year>2013</year>
<volume>64</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>1695-724</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>[14]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reeves]]></surname>
<given-names><![CDATA[C.R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Modern heuristic techniques for combinatorial problems]]></source>
<year>1993</year>
<page-range>320</page-range><publisher-name><![CDATA[John Wiley &amp; Sons, Inc]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>[15]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Luke]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Essentials of metaheuristics.]]></source>
<year>2013</year>
<page-range>261</page-range><publisher-name><![CDATA[Lulu, second edition]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<label>[16]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Haupt]]></surname>
<given-names><![CDATA[R.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Haupt]]></surname>
<given-names><![CDATA[S. E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Practical genetic algorithms]]></source>
<year>2004</year>
<publisher-loc><![CDATA[New Jersey ]]></publisher-loc>
<publisher-name><![CDATA[John Wiley &amp; Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<label>[17]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dorigo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Ant Colony Optimization and Swarm Intelligence]]></source>
<year></year>
<conf-name><![CDATA[ Proc. 5th International Workshop, ANTS, 4150]]></conf-name>
<conf-date>2006</conf-date>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B18">
<label>[18]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kirkpatrick]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Gelatt]]></surname>
<given-names><![CDATA[C.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Vecchi]]></surname>
<given-names><![CDATA[M. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimization by simulated annealing]]></article-title>
<source><![CDATA[Science]]></source>
<year>1983</year>
<volume>220</volume>
<numero>4598</numero>
<issue>4598</issue>
<page-range>671-80</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[Rodríguez]]></surname>
<given-names><![CDATA[D.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Olivera]]></surname>
<given-names><![CDATA[A. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Brignole]]></surname>
<given-names><![CDATA[N. B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hiperheurística Diseñada para un Problema de Localización]]></article-title>
<source><![CDATA[Mec. Comp]]></source>
<year>2014</year>
<volume>XXXIII</volume>
<page-range>2513-21</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>[20]</label><nlm-citation citation-type="">
<source><![CDATA[GAMS. Development Corporation. GAMS. The Solver Manuals]]></source>
<year>2013</year>
<publisher-loc><![CDATA[San Francisco, CA, USA ]]></publisher-loc>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
