<?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>1409-2433</journal-id>
<journal-title><![CDATA[Revista de Matemática Teoría y Aplicaciones]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Mat]]></abbrev-journal-title>
<issn>1409-2433</issn>
<publisher>
<publisher-name><![CDATA[Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1409-24332020000200305</article-id>
<article-id pub-id-type="doi">10.15517/rmta.v27i2.37889artículo</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Matheurísticas para resolver el problema de ruteo de vehículos con ventanas de tiempo]]></article-title>
<article-title xml:lang="en"><![CDATA[Matheuristics for solving the vehicle routing problem with time windows]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Montes-Orozco]]></surname>
<given-names><![CDATA[Edwin]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[Román A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Obregón-Quintana]]></surname>
<given-names><![CDATA[Bibiana]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[De-Los-Cobos-Silva]]></surname>
<given-names><![CDATA[Sergio G.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[Eric A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gutiérrez-Andrade]]></surname>
<given-names><![CDATA[Miguel A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Lara-Velázquez]]></surname>
<given-names><![CDATA[Pedro]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Autónoma Metropolitana Iztapalapa Posgrado en Ciencias y Tecnologías de la Información ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Autónoma Metropolitana Azcapotzalco  Departamento de Sistemas]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Nacional Autónoma de México Facultad de Ciencias Departamento de Matemáticas]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Universidad Autónoma Metropolitana Iztapalapa  Departamento de Ingeniería Eléctrica]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af5">
<institution><![CDATA[,Universidad Autónoma Metropolitana Iztapalapa  Departamento de Ingeniería Eléctrica]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af6">
<institution><![CDATA[,Universidad Autónoma Metropolitana Iztapalapa  Departamento de Ingeniería Eléctrica]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af7">
<institution><![CDATA[,Universidad Autónoma Metropolitana Iztapalapa  Departamento de Ingeniería Eléctrica]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2020</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2020</year>
</pub-date>
<volume>27</volume>
<numero>2</numero>
<fpage>305</fpage>
<lpage>332</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_arttext&amp;pid=S1409-24332020000200305&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_abstract&amp;pid=S1409-24332020000200305&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.sa.cr/scielo.php?script=sci_pdf&amp;pid=S1409-24332020000200305&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen En este trabajo, se presentan dos técnicas matheurísticas basadas en dos técnicas heurísticas: Sistema de hormigas (AS), método de composición musical (MMC) y dos métodos exactos: Algoritmo primal-dual (PDA) y algoritmo simplex dual (DSA). Estas técnicas se denotan como DS-ASPDA y DS-MMC-AS y se caracterizan por aprovechar la información de la estructura y características del modelo matemático para el problema de ruteo de vehículos con ventanas de tiempo (VRP-TW). Con el objetivo de caracterizar el comportamiento de las técnicas propuestas en este trabajo, se utilizaron 29 instancias de prueba para el VRP-TW. Los resultados numéricos, muestran que DS-AS-PDA y DS-MMC-AS presentan un comportamiento robusto y son capaces de generar las mejores soluciones reportadas en la literatura con un número menor de llamadas a la función objetivo para diversos tamaños de instancias.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract In this work, we present two matheuristic techniques based on two heuristic techniques: Ant system (AS), method of musical composition (MMC) and two exact methods: Primal-dual algorithm (PDA) and dual simplex algorithm (DSA). These techniques are denoted as DS-AS-PDA and DS-MMC-AS and are characterized by taking advantage of the information of the structure and characteristics of the mathematical model for the vehicle routing problem with time windows (VRP-TW). In order to characterize the behavior of the techniques proposed in this work, we use 29 test instances for the VRP-TW. The numerical results show that DS-AS-PDA and DS-MMC-AS exhibit robust behavior and are capable of generating the best solutions reported in the literature with a smaller number of calls to the objective function.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[heurísticas]]></kwd>
<kwd lng="es"><![CDATA[optimización]]></kwd>
<kwd lng="es"><![CDATA[algoritmos híbridos]]></kwd>
<kwd lng="es"><![CDATA[logística.]]></kwd>
<kwd lng="en"><![CDATA[heuristics]]></kwd>
<kwd lng="en"><![CDATA[optimization]]></kwd>
<kwd lng="en"><![CDATA[hybrid algorithms]]></kwd>
<kwd lng="en"><![CDATA[logistic.]]></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[M]]></surname>
<given-names><![CDATA[Alzaqebah]]></given-names>
</name>
<name>
<surname><![CDATA[S]]></surname>
<given-names><![CDATA[Abdullah]]></given-names>
</name>
<name>
<surname><![CDATA[S]]></surname>
<given-names><![CDATA[Jawarneh.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modified artificial bee colony for the vehicle routing problems with time windows]]></article-title>
<source><![CDATA[SpringerPlus]]></source>
<year>2016</year>
<volume>5</volume>
<numero>1298</numero>
<issue>1298</issue>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[M]]></surname>
<given-names><![CDATA[Batsyn]]></given-names>
</name>
<name>
<surname><![CDATA[I]]></surname>
<given-names><![CDATA[Bychkov]]></given-names>
</name>
<name>
<surname><![CDATA[L]]></surname>
<given-names><![CDATA[Komosko]]></given-names>
</name>
<name>
<surname><![CDATA[A]]></surname>
<given-names><![CDATA[Nikolaev.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tabu search for fleet size and mix vehicle routing problem with hard and soft time windows]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[V,A]]></surname>
<given-names><![CDATA[Kalyagin]]></given-names>
</name>
<name>
<surname><![CDATA[P,M]]></surname>
<given-names><![CDATA[Pardalos]]></given-names>
</name>
<name>
<surname><![CDATA[O]]></surname>
<given-names><![CDATA[Prokopyev]]></given-names>
</name>
<name>
<surname><![CDATA[I]]></surname>
<given-names><![CDATA[Utkina.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computational Aspects and Applications in Large-Scale Networks]]></source>
<year>2018</year>
<publisher-loc><![CDATA[Cham ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[M,A]]></surname>
<given-names><![CDATA[Boschetti]]></given-names>
</name>
<name>
<surname><![CDATA[V]]></surname>
<given-names><![CDATA[Maniezzo]]></given-names>
</name>
<name>
<surname><![CDATA[M]]></surname>
<given-names><![CDATA[Roffilli]]></given-names>
</name>
<name>
<surname><![CDATA[A]]></surname>
<given-names><![CDATA[Bolufé Röhler.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Matheuristics: Optimization, simulation and control]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[M,J]]></surname>
<given-names><![CDATA[Blesa]]></given-names>
</name>
<name>
<surname><![CDATA[C]]></surname>
<given-names><![CDATA[Blum]]></given-names>
</name>
<name>
<surname><![CDATA[L]]></surname>
<given-names><![CDATA[Di Gaspero]]></given-names>
</name>
<name>
<surname><![CDATA[A]]></surname>
<given-names><![CDATA[Roli]]></given-names>
</name>
<name>
<surname><![CDATA[M]]></surname>
<given-names><![CDATA[Sampels]]></given-names>
</name>
<name>
<surname><![CDATA[A]]></surname>
<given-names><![CDATA[Schaerf.]]></given-names>
</name>
</person-group>
<source><![CDATA[Hybrid Metaheuristics]]></source>
<year>2009</year>
<page-range>171-7</page-range><publisher-loc><![CDATA[Berlin Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[I]]></surname>
<given-names><![CDATA[Bychkov]]></given-names>
</name>
<name>
<surname><![CDATA[M]]></surname>
<given-names><![CDATA[Batsyn.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid approach for the capacitated vehicle routing problem with time windows]]></article-title>
<source><![CDATA[Optimization Problems and their Applications]]></source>
<year>2018</year>
<page-range>66-81</page-range><publisher-loc><![CDATA[Omsk, Russia ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[M]]></surname>
<given-names><![CDATA[Caserta]]></given-names>
</name>
<name>
<surname><![CDATA[S]]></surname>
<given-names><![CDATA[Voß.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Metaheuristics: Intelligent problem solving]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[V]]></surname>
<given-names><![CDATA[Maniezzo]]></given-names>
</name>
<name>
<surname><![CDATA[T]]></surname>
<given-names><![CDATA[Stützle]]></given-names>
</name>
<name>
<surname><![CDATA[S]]></surname>
<given-names><![CDATA[Voß.]]></given-names>
</name>
</person-group>
<source><![CDATA[Matheuristics. Hybridizing Metaheuristics and Mathematical Programming, Annals of Information Systems]]></source>
<year>2009</year>
<volume>10</volume>
<page-range>1-38</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[B]]></surname>
<given-names><![CDATA[Chen]]></given-names>
</name>
<name>
<surname><![CDATA[R]]></surname>
<given-names><![CDATA[Qu]]></given-names>
</name>
<name>
<surname><![CDATA[R]]></surname>
<given-names><![CDATA[Bai]]></given-names>
</name>
<name>
<surname><![CDATA[H]]></surname>
<given-names><![CDATA[Ishibuchi.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A variable neighbourhood search algorithm with compound neighbourhoods for VRPTW]]></article-title>
<source><![CDATA[Proceedings of 5th the International Conference on Operations Research and Enterprise Systems]]></source>
<year>2016</year>
<volume>1</volume>
<page-range>25-35</page-range><publisher-loc><![CDATA[Rome, Italy ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[J,F]]></surname>
<given-names><![CDATA[Cordeau]]></given-names>
</name>
<name>
<surname><![CDATA[G]]></surname>
<given-names><![CDATA[Desaulniers]]></given-names>
</name>
<name>
<surname><![CDATA[J]]></surname>
<given-names><![CDATA[Desrosiers]]></given-names>
</name>
<name>
<surname><![CDATA[M,M]]></surname>
<given-names><![CDATA[Solomon]]></given-names>
</name>
<name>
<surname><![CDATA[F]]></surname>
<given-names><![CDATA[Soumis.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The VRP with time windows]]></article-title>
<source><![CDATA[Les Cahiers du GERAD]]></source>
<year>2000</year>
<numero>G99-13</numero>
<issue>G99-13</issue>
<page-range>1-38</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[J,F]]></surname>
<given-names><![CDATA[Cordeau]]></given-names>
</name>
<name>
<surname><![CDATA[G]]></surname>
<given-names><![CDATA[Laporte.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The dial-a-ride problem: models and algorithms]]></article-title>
<source><![CDATA[Annals of Operations Research]]></source>
<year>2007</year>
<volume>153</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>29-46</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dantzig.]]></surname>
<given-names><![CDATA[G ,B]]></given-names>
</name>
</person-group>
<source><![CDATA[Linear Programming and Extensions]]></source>
<year>1963</year>
<publisher-loc><![CDATA[Princeton NJ ]]></publisher-loc>
<publisher-name><![CDATA[Princeton University Press, The Rand Corporation]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[G,B]]></surname>
<given-names><![CDATA[Dantzig]]></given-names>
</name>
<name>
<surname><![CDATA[L,R]]></surname>
<given-names><![CDATA[Ford]]></given-names>
</name>
<name>
<surname><![CDATA[D,R]]></surname>
<given-names><![CDATA[Fulkerson.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A primal-dual algorithm for linear programs]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[H,W]]></surname>
<given-names><![CDATA[Kuhn]]></given-names>
</name>
<name>
<surname><![CDATA[A,W]]></surname>
<given-names><![CDATA[Tucker.]]></given-names>
</name>
</person-group>
<source><![CDATA[Linear Inequalities and Related Systems]]></source>
<year>1956</year>
<page-range>171-81</page-range><publisher-loc><![CDATA[Princeton NJ ]]></publisher-loc>
<publisher-name><![CDATA[Princeton University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[S,G]]></surname>
<given-names><![CDATA[De-Los-Cobos-Silva]]></given-names>
</name>
<name>
<surname><![CDATA[R,A]]></surname>
<given-names><![CDATA[Mora-Gutiérrez]]></given-names>
</name>
<name>
<surname><![CDATA[M,A]]></surname>
<given-names><![CDATA[Gutiérrez-Andrade]]></given-names>
</name>
<name>
<surname><![CDATA[E,A]]></surname>
<given-names><![CDATA[Rincón-García]]></given-names>
</name>
<name>
<surname><![CDATA[A]]></surname>
<given-names><![CDATA[Ponsich]]></given-names>
</name>
<name>
<surname><![CDATA[P]]></surname>
<given-names><![CDATA[Lara-Velázquez.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Development of seven hybrid methods based on collective intelligence for solving nonlinear constrained optimization problems]]></article-title>
<source><![CDATA[Artificial Intelligence Review]]></source>
<year>2018</year>
<volume>49</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>245-79</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[M]]></surname>
<given-names><![CDATA[Dorigo]]></given-names>
</name>
<name>
<surname><![CDATA[V]]></surname>
<given-names><![CDATA[Maniezzo]]></given-names>
</name>
<name>
<surname><![CDATA[A]]></surname>
<given-names><![CDATA[Colorni.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Ant system: Optimization by a colony of cooperating agents]]></article-title>
<source><![CDATA[IEEE Transactions on Systems, Man, and Cybernetics]]></source>
<year>1996</year>
<volume>26</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>29-41</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[M,X]]></surname>
<given-names><![CDATA[Goemans]]></given-names>
</name>
<name>
<surname><![CDATA[D,P]]></surname>
<given-names><![CDATA[Williamson.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The primal-dual method for approximation algorithms and its application to network design problems]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[D,S]]></surname>
<given-names><![CDATA[Hochbaum.]]></given-names>
</name>
</person-group>
<source><![CDATA[Approximation Algorithms for NPhard Problems]]></source>
<year>1996</year>
<page-range>144-91</page-range><publisher-loc><![CDATA[New Orleans ]]></publisher-loc>
<publisher-name><![CDATA[PWS Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="">
<collab>Gurobi Optimizer Inc.</collab>
<source><![CDATA[Gurobi optimizer reference manual, G. Optimization, Inc.]]></source>
<year>2019</year>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[D]]></surname>
<given-names><![CDATA[Karaboga]]></given-names>
</name>
<name>
<surname><![CDATA[B]]></surname>
<given-names><![CDATA[Basturk.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[P]]></surname>
<given-names><![CDATA[Melin]]></given-names>
</name>
<name>
<surname><![CDATA[O]]></surname>
<given-names><![CDATA[Castillo]]></given-names>
</name>
<name>
<surname><![CDATA[L,T]]></surname>
<given-names><![CDATA[Aguilar]]></given-names>
</name>
<name>
<surname><![CDATA[J]]></surname>
<given-names><![CDATA[Kacptrzyk]]></given-names>
</name>
<name>
<surname><![CDATA[W]]></surname>
<given-names><![CDATA[Pedrycz.]]></given-names>
</name>
</person-group>
<source><![CDATA[Lecture Notes in Artificial Intelligence]]></source>
<year>2007</year>
<page-range>789-98</page-range><publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[J,K]]></surname>
<given-names><![CDATA[Lenstra]]></given-names>
</name>
<name>
<surname><![CDATA[A,H,G]]></surname>
<given-names><![CDATA[Rinooy Kan.]]></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="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[T,Y]]></surname>
<given-names><![CDATA[Ma.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A cross entropy multiagent learning algorithm for solving vehicle routing problems with time windows]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[J,W]]></surname>
<given-names><![CDATA[Böse]]></given-names>
</name>
<name>
<surname><![CDATA[H]]></surname>
<given-names><![CDATA[Hu]]></given-names>
</name>
<name>
<surname><![CDATA[C]]></surname>
<given-names><![CDATA[Jahn]]></given-names>
</name>
<name>
<surname><![CDATA[X]]></surname>
<given-names><![CDATA[Shi]]></given-names>
</name>
<name>
<surname><![CDATA[R]]></surname>
<given-names><![CDATA[Stahlbock]]></given-names>
</name>
<name>
<surname><![CDATA[S]]></surname>
<given-names><![CDATA[Voß.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computational Logistics, Lecture Notes in Computer Science 6971]]></source>
<year>2011</year>
<page-range>59-73</page-range><publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[E]]></surname>
<given-names><![CDATA[Montes-Orozco.]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheurísticas para el problema de ruteo de vehículos con ventanas de tiempo (VRP-TW)]]></source>
<year>2017</year>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Autónoma Metropolitana Unidad Azcapotzalco]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[R,A]]></surname>
<given-names><![CDATA[Mora-Gutiérrez]]></given-names>
</name>
<name>
<surname><![CDATA[J]]></surname>
<given-names><![CDATA[Ramírez-Rodríguez]]></given-names>
</name>
<name>
<surname><![CDATA[E,A]]></surname>
<given-names><![CDATA[Rincón-García.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An optimization algorithm inspired by musical composition]]></article-title>
<source><![CDATA[Artificial Intelligence Review]]></source>
<year>2014</year>
<volume>41</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>301-15</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[R,A]]></surname>
<given-names><![CDATA[Mora-Gutiérrez]]></given-names>
</name>
<name>
<surname><![CDATA[J]]></surname>
<given-names><![CDATA[Ramírez-Rodríguez]]></given-names>
</name>
<name>
<surname><![CDATA[E,A]]></surname>
<given-names><![CDATA[Rincón-García]]></given-names>
</name>
<name>
<surname><![CDATA[A]]></surname>
<given-names><![CDATA[Ponsich]]></given-names>
</name>
<name>
<surname><![CDATA[O]]></surname>
<given-names><![CDATA[Herrera]]></given-names>
</name>
<name>
<surname><![CDATA[P]]></surname>
<given-names><![CDATA[Lara-Velázquez]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Adaptation of the musical composition method for solving constrained optimization problems]]></article-title>
<source><![CDATA[Soft Computing]]></source>
<year>2014</year>
<volume>18</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>1931-48</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[C,H]]></surname>
<given-names><![CDATA[Papadimitriou]]></given-names>
</name>
<name>
<surname><![CDATA[K]]></surname>
<given-names><![CDATA[Steiglitz]]></given-names>
</name>
</person-group>
<source><![CDATA[Combinatorial Optimization: Algorithms and Complexity]]></source>
<year>1998</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Dover Publications]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[H,G,M]]></surname>
<given-names><![CDATA[Pullen]]></given-names>
</name>
<name>
<surname><![CDATA[M,H,J]]></surname>
<given-names><![CDATA[Webb.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A computer application to a transport scheduling problem]]></article-title>
<source><![CDATA[The Computer Journal]]></source>
<year>1967</year>
<volume>10</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>10-3</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[A,K]]></surname>
<given-names><![CDATA[Qin]]></given-names>
</name>
<name>
<surname><![CDATA[P,N]]></surname>
<given-names><![CDATA[Suganthan.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Self-adaptive differential evolution algorithm for numerical optimization]]></article-title>
<source><![CDATA[Evolutionary Computation]]></source>
<year>2005</year>
<page-range>1785-91</page-range><publisher-loc><![CDATA[Edinburgh, Scotland ]]></publisher-loc>
<publisher-name><![CDATA[The 2005 IEEE Congress on Evolutionary Computation]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[P,P]]></surname>
<given-names><![CDATA[Repoussis]]></given-names>
</name>
<name>
<surname><![CDATA[C,D]]></surname>
<given-names><![CDATA[Tarantilis]]></given-names>
</name>
<name>
<surname><![CDATA[G]]></surname>
<given-names><![CDATA[Ioannou.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Arc-guided evolutionary algorithm for the vehicle routing problem with time windows]]></article-title>
<source><![CDATA[IEEE Transactions on Evolutionary Computation]]></source>
<year>2009</year>
<volume>13</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>624-47</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[D,M]]></surname>
<given-names><![CDATA[Ryan]]></given-names>
</name>
<name>
<surname><![CDATA[C]]></surname>
<given-names><![CDATA[Hjorring]]></given-names>
</name>
<name>
<surname><![CDATA[F]]></surname>
<given-names><![CDATA[Glover.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Extensions of the petal method for vehicle routing]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>1993</year>
<volume>44</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>289-96</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[T]]></surname>
<given-names><![CDATA[Saeheaw]]></given-names>
</name>
<name>
<surname><![CDATA[N]]></surname>
<given-names><![CDATA[Charoenchai.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Comparison of meta-heuristic algorithms for vehicle routing problem with time windows]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[H,A]]></surname>
<given-names><![CDATA[Sulaiman.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advanced Computer and Communication Engineering Technology]]></source>
<year>2016</year>
<page-range>1263-73</page-range><publisher-loc><![CDATA[Switzerland ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[M,M]]></surname>
<given-names><![CDATA[Solomon.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algorithms for the vehicle routing and scheduling problems with time window constraints]]></article-title>
<source><![CDATA[Operations Research]]></source>
<year>1987</year>
<volume>35</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>254-65</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[P]]></surname>
<given-names><![CDATA[Toth]]></given-names>
</name>
<name>
<surname><![CDATA[D]]></surname>
<given-names><![CDATA[Vigo.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Vehicle Routing Problem]]></source>
<year>2002</year>
<publisher-loc><![CDATA[Philadelphia ]]></publisher-loc>
<publisher-name><![CDATA[Society for Industrial and Applied Mathematics]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
