<?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>0121-750X</journal-id>
<journal-title><![CDATA[Ingeniería]]></journal-title>
<abbrev-journal-title><![CDATA[ing.]]></abbrev-journal-title>
<issn>0121-750X</issn>
<publisher>
<publisher-name><![CDATA[Universidad Distrital Francisco José de Caldas]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0121-750X2021000200233</article-id>
<article-id pub-id-type="doi">10.14483/23448393.15835</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Una solución metaheurística al problema de planificación de rutas de autobuses escolares con flota homogénea y selección de paradas]]></article-title>
<article-title xml:lang="en"><![CDATA[A Metaheuristic Solution for the School Bus Routing Problem with Homogeneous Fleet and Bus Stop Selection]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Pérez Pérez]]></surname>
<given-names><![CDATA[Ana Camila]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ansola]]></surname>
<given-names><![CDATA[Eduardo Sánchez]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rosete]]></surname>
<given-names><![CDATA[Alejandro]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Tecnológica de La Habana José A. Echeverría  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Tecnológica de La Habana José A. Echeverría  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Tecnológica de La Habana José A. Echeverría  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>08</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>08</month>
<year>2021</year>
</pub-date>
<volume>26</volume>
<numero>2</numero>
<fpage>233</fpage>
<lpage>253</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0121-750X2021000200233&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0121-750X2021000200233&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0121-750X2021000200233&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen  Contexto:  Los problemas de optimización permiten representar situaciones de la vida real, y con un método apropiado se puede llegar a una buena solución del problema. Conceptualmente, el problema bajo estudio se conoce como problema de planificación de ruta de autobuses escolares. El presente trabajo puede ser tomado como punto de partida para la creación de herramientas para este problema.  Método:  En este trabajo se diseñó e implementó un modelo matemático del problema basado en la literatura y se adaptó para su solución usando algoritmos metaheurísticos. Se implementaron tres operadores de mutación y un mecanismo de selección basado en pesos, según las mejoras que brindaba cada uno a la solución. Para evaluar los resultados, se realizó una comparación estadística con otra solución de la literatura a partir de la evaluación de 112 instancias del problema.  Resultados:  En la solución de las 112 instancias del problema se utilizaron los siguientes algoritmos: búsqueda tabú, variantes del escalador de colinas, recocido simulado y un portafolio de algoritmos que incluye a los anteriores. Los resultados reflejaron que el mejor comportamiento lo obtuvo el portafolio con resultados comparables a los de la literatura. Sin embargo, a medida que crece el número de instancias, los resultados tienden a empeorar.  Conclusiones:  Con esta investigación se obtuvo un modelo que permite representar el problema inicial, así como dos algoritmos para la búsqueda de soluciones utilizando metaheurísticas. Según los resultados obtenidos, los trabajos futuros deben encaminarse hacia nuevas formas de construcción de la solución inicial y la implementación de nuevos operadores de asignación y mutación.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract  Context:  Optimization problems allow representing real-life situations, and, with the right method, a good solution to a problem can be reached. Conceptually, the problem under study is known as the School Bus Routing Problem. This work can be taken as a starting point for the creation of tools for this problem.  Method:  In this work, a mathematical model based on the literature was designed and implemented, and it was adapted to be solved using metaheuristics. Three mutation operators and a selection mechanism based on weights were implemented according to the improvements that each of them offered to the solution. To evaluate the results, a statistical comparison was made with another solution in the literature based on the evaluation of 112 instances of the problem.  Results:  In the solution of the 112 instances of the problem, the following algorithms were used: the Tabu Search, Hill Climbing variants, Simulated Annealing, and an algorithm portfolio that includes the previous ones. The results showed that the best behavior was obtained by the portfolio, with results comparable to those in the literature. However, as the number of instances grows, the results tend to get worse.  Conclusions:  With this research, it was possible to obtain a model that represents the initial problem, as well as two algorithms for finding solutions by means of metaheuristics. According to the results obtained, future work should be directed towards new ways of building the initial solution and the implementation of new assignment operators.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[metaheurísticas]]></kwd>
<kwd lng="es"><![CDATA[modelo de optimización]]></kwd>
<kwd lng="es"><![CDATA[problema de planificación de rutas de autobuses escolares.]]></kwd>
<kwd lng="en"><![CDATA[metaheuristics]]></kwd>
<kwd lng="en"><![CDATA[optimization model]]></kwd>
<kwd lng="en"><![CDATA[school bus routing problem.]]></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[Newton]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Thomas]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Design of school bus routes by computer]]></article-title>
<source><![CDATA[Socio-Economic Planning Sciences]]></source>
<year>1969</year>
<volume>3</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>75-85</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[Li]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Fu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The school bus routing problem: A case study]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2002</year>
<volume>53</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>552-8</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[Machado]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Simões]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Vieira]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramos]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A mixed load capacitated rural school bus routing problem with heterogeneous fleet: Algorithms for the Brazilian context]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2016</year>
<volume>56</volume>
<page-range>320-34</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[Fonseca]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sarubbi]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Silva]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Porto]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramos]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A real geographical application for the school bus routing problem]]></article-title>
<source><![CDATA[17th International IEEE Conference on Intelligent Transportation Systems (ITSC)]]></source>
<year>2014</year>
</nlm-citation>
</ref>
<ref id="B5">
<label>[5]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[López]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Romero]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Un aproximación híbrida de generación de columnas y agrupación para resolver el problema de ruteo de buses escolares con ventanas de tiempo]]></article-title>
<source><![CDATA[Ingeniería]]></source>
<year>2015</year>
<volume>20</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>111-27</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[Bock]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Grant]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Könemann]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Sanità]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The school bus problem on trees]]></article-title>
<source><![CDATA[Algorithmica]]></source>
<year>2013</year>
<volume>67</volume>
<page-range>49-64</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[Moura]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[de Camargo]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Conceição]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Porto]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Nunes]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multi-loading school bus routing problem]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2018</year>
<volume>101</volume>
<page-range>228-42</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>[8]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Talbi]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheuristics: From Design to Implementation, John Wiley &amp; Sons, Inc]]></source>
<year>2009</year>
<page-range>500</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[Park]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[B.-I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The school bus routing problem: A review]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2010</year>
<volume>202</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>311-9</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[Ellegood]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Solomon]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[North]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Campbell]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[School bus routing problem: Contemporary trends and research directions]]></article-title>
<source><![CDATA[Omega]]></source>
<year>2020</year>
<volume>95</volume>
</nlm-citation>
</ref>
<ref id="B11">
<label>[11]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Riera-Ledesma]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Salazar-González]]></surname>
<given-names><![CDATA[J. J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A column generation approach for a school bus routing problem with resource constraints]]></article-title>
<source><![CDATA[Computers and Operations Research]]></source>
<year>2013</year>
<volume>40</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>566-83</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[Bowerman]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Hall]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Calamai]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multi-objective optimization approach to urban school bus routing: Formulation and solution method]]></article-title>
<source><![CDATA[Transportation Research Part A: Policy and Practice]]></source>
<year>1995</year>
<volume>29</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>107-23</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>[13]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schittekat]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Kinable]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Sörensen]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Sevaux]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Spieksma]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Springael]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A metaheuristic [1]for the school bus routing problem with bus stop selection]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2013</year>
<volume>229</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>518-28</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>[14]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Kong]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Dang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Hou]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Ye]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Exact and metaheuristic approaches for a bi-objective school bus scheduling problem]]></article-title>
<source><![CDATA[Plos One]]></source>
<year>2015</year>
<volume>10</volume>
<numero>7</numero>
<issue>7</issue>
</nlm-citation>
</ref>
<ref id="B15">
<label>[15]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Spada]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Bierlaire]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Liebling]]></surname>
<given-names><![CDATA[T. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Decision-aiding methodology for the school bus routing and scheduling problem]]></article-title>
<source><![CDATA[Transportation Science]]></source>
<year>2005</year>
<volume>39</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>443-556</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[Chen]]></surname>
<given-names><![CDATA[D.-S.]]></given-names>
</name>
<name>
<surname><![CDATA[Kallsen]]></surname>
<given-names><![CDATA[H. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[H.-C.]]></given-names>
</name>
<name>
<surname><![CDATA[Tseng]]></surname>
<given-names><![CDATA[V.-C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A bus routing system for rural school districts]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>1990</year>
<volume>19</volume>
<numero>1-4</numero>
<issue>1-4</issue>
<page-range>322-5</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[Kinable]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Spieksma]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Vanden]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[School bus routing: a column generation approach]]></article-title>
<source><![CDATA[International Transactions in Operational Research]]></source>
<year>2014</year>
<volume>21</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>453-78</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[Ezquerro]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Moura]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ibeas]]></surname>
<given-names><![CDATA[Á.]]></given-names>
</name>
<name>
<surname><![CDATA[Benavente]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimization model for school transportation design based on economic and social efficiency]]></article-title>
<source><![CDATA[Transport Policy]]></source>
<year>2018</year>
<volume>67</volume>
<page-range>93-101</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[Caceres]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Batta]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[He]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[School bus routing with stochastic demand and duration constraints]]></article-title>
<source><![CDATA[Transportation Science]]></source>
<year>2017</year>
<volume>51</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1031-386</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[de Souza Lima]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Pereira]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[da Conceição]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Camargo]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads]]></article-title>
<source><![CDATA[4OR-A Quarterly Journal of Operations Research]]></source>
<year>2017</year>
<volume>15</volume>
<page-range>359-86</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[Pacheco]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Martí]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tabu search for a multi-objective routing problem]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2006</year>
<volume>57</volume>
<numero>1</numero>
<issue>1</issue>
</nlm-citation>
</ref>
<ref id="B22">
<label>[22]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Corberán]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Fernández]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Laguna]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Martí]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Heuristic solutions to the problem of routing school buses with multiple objectives]]></article-title>
<source><![CDATA[Journal of Operational Research Society]]></source>
<year>2002</year>
<volume>53</volume>
<numero>4</numero>
<issue>4</issue>
</nlm-citation>
</ref>
<ref id="B23">
<label>[23]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sales]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Sousa]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[de Oliveira]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Athayde]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Memetic algorithm for the heterogeneous fleet school bus routing problem]]></article-title>
<source><![CDATA[Journal of Urban Planning Development]]></source>
<year>2018</year>
<volume>144</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B24">
<label>[24]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Braca]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Bramel]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Posner]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Simchi-Levi]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A computerized approach to the New York Cityschool bus routing problem]]></article-title>
<source><![CDATA[IIE Transactions]]></source>
<year>1997</year>
<volume>29</volume>
<page-range>693-702</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>[25]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Astorga]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Crawford]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Soto]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Monfroy]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Cortés]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Un enfoque de meta- optimización para resolver el problema de cobertura de conjunto]]></article-title>
<source><![CDATA[Ingeniería]]></source>
<year>2018</year>
<volume>23</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>274-88</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>[26]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fajardo]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Soft Computing en problemas de optimización dinámicos]]></source>
<year>2016</year>
<publisher-loc><![CDATA[Granada ]]></publisher-loc>
<publisher-name><![CDATA[Universidad de Granada]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<label>[27]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lewis]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith-Miles]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Phillips]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The school bus routing problem: An analysis and algorithm]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Brankovic]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Ryan]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Smyth]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<source><![CDATA[Combinatorial Algorithm]]></source>
<year>2018</year>
<volume>10765</volume>
<page-range>287-98</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<label>[28]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Toro]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Escobar]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Granada]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Literature review on the vehicle routing problem in the green transportation context]]></article-title>
<source><![CDATA[Luna Azul]]></source>
<year>2016</year>
<volume>42</volume>
<page-range>362-87</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[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[IEEE Transactions on Evolutionary Computation]]></source>
<year>1997</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>67-82</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>[30]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Derrac]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Molina]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Herrera]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms]]></article-title>
<source><![CDATA[Swarm and Evolutionary Computation]]></source>
<year>2011</year>
<volume>1</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>3-18</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
