<?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-750X2020000200117</article-id>
<article-id pub-id-type="doi">10.14483/23448393.15271</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Un Problema de Enrutamiento del Vehículo con Enfoque de Ventanas de Tiempo Para Mejorar el Proceso de Entregas]]></article-title>
<article-title xml:lang="en"><![CDATA[A vehicle routing problem with a time windows approach to improve the delivery process]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Pineda Zapata]]></surname>
<given-names><![CDATA[Uriel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Carabalí Ararat]]></surname>
<given-names><![CDATA[Hader]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Santiago de Cali Facultad de Ingeniería ]]></institution>
<addr-line><![CDATA[Cali ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Dumian Medical  ]]></institution>
<addr-line><![CDATA[Cali ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>08</month>
<year>2020</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>08</month>
<year>2020</year>
</pub-date>
<volume>25</volume>
<numero>2</numero>
<fpage>117</fpage>
<lpage>143</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0121-750X2020000200117&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-750X2020000200117&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-750X2020000200117&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen  Contexto:  Este artículo plantea resolver el problema de represamiento de entregas identificado en 2018 en una empresa dedicada al servicio de entregas de paquetes y mercancías, localizada en el Valle del Cauca, Colombia, a partir de la optimización del proceso logístico que permita reducir los tiempos del proceso de entregas a los clientes y evitar pérdidas para la empresa. Esto significa generar rutas adecuadas, según el problema clásico denominado problema de enrutamiento del vehículo (VRP, por sus siglas en inglés).  Método:  Se analiza la información de más de 200 clientes para su realización. Se combinaron herramientas de calidad tales como el análisis de Pareto y el enfoque de procesos con técnicas de optimización basadas en el método Clarke-Wright y el uso de ventanas de tiempo por medio del programa VRP Solver 3.0.  Resultados:  Con el diseño de las rutas propuesto para atender las entregas de una de las zonas de mayor demanda en la empresa (zona centro), los resultados de la simulación arrojaron un aumento en el nivel de servicio del 60 %, dado el uso del vehículo para la distribución en una jornada laboral completa y no solo en media jornada. Se evidencia que el aumento en los clientes atendidos genera ingresos adicionales suficientes para cubrir los costos de usar el vehículo una jornada más, con utilidades para la empresa. Asimismo, la capacidad de entrega en Tm se aumenta en un 39 %. De este modo, se elimina la mercancía represada.  Conclusiones:  Con el uso de ventanas de tiempo, se propone un método para la programación de rutas mediante la aplicación de la herramienta VRP Solver 3.0, consecuente con la operación del día a día en operadores logísticos como el caso estudiado. Igualmente, este artículo constituye una manera de acercar los conocimientos teóricos de la academia a la gestión eficiente del servicio en las Pymes. Así, empresas, como la del caso presentado pueden mejorar aún más su nivel de servicio con tecnologías apropiadas para el tratamiento y control de la información de los clientes, con miras a la planificación de las entregas.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract  Context:  This paper proposes to solve the problem of accumulated deliveries, identified in 2018, in a company dedicated to the service of deliveries of packages and merchandise, located in Valle del Cauca,Colombia, based on the optimization of the logistics process that allows reducing delivery times to customers and avoiding wastages for the company. This means generating appropriate routes, according to the classic problem called Vehicle Routing Problem (VRP).  Method:  The information of more than 200 clients is analyzed for its realization. Quality tools, such as Pareto analysis and process approach, were combined with optimization techniques based on the Clarke-Wright method and the use of time windows through the VRP Solver 3.0 program.  Results:  With the design of the routes proposed to meet the deliveries of one of the areas with the highest demand in the company (Central Zone), the results of the simulation showed an increase in the service level of 60 %, given the use of the vehicle to the distribution in a complete working day and not only in half day of work. It is evident that the increase in customers served generates additional income, sufficient to cover the costs of using the vehicle half working day more, with profits for the company. Likewise, the delivery capacity, in Tm, is increased by 39 %. So the accumulated merchandise by delivery is eliminated.  Conclusions:  With the use of time windows, a method for route programming is proposed by applying the VRP Solver 3.0 tool, more consistent with the daily operation of logistics operators as the case studied. Likewise, this article constitutes a way of bringing the theoretical knowledge of the academy to the efficient management of the service in SMEs. Thus, companies like the case presented, can further improve their service level with appropriate technologies for the processing and control of customer information, with the purpose to planning the deliveries.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Logística]]></kwd>
<kwd lng="es"><![CDATA[nivel de servicio]]></kwd>
<kwd lng="es"><![CDATA[optimización]]></kwd>
<kwd lng="es"><![CDATA[problema de enrutamiento del vehículo]]></kwd>
<kwd lng="es"><![CDATA[proceso de entregas]]></kwd>
<kwd lng="es"><![CDATA[ventanas de tiempo.]]></kwd>
<kwd lng="en"><![CDATA[Delivery process]]></kwd>
<kwd lng="en"><![CDATA[logistics]]></kwd>
<kwd lng="en"><![CDATA[optimization]]></kwd>
<kwd lng="en"><![CDATA[service level]]></kwd>
<kwd lng="en"><![CDATA[time windows]]></kwd>
<kwd lng="en"><![CDATA[vehicle routing problem.]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>[1]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wei-min]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Dong]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Competitive analysis for the on-line vehicle routing problem]]></source>
<year>2010</year>
<conf-name><![CDATA[ International Conference on New Trends]]></conf-name>
<conf-loc>Gyeongju </conf-loc>
</nlm-citation>
</ref>
<ref id="B2">
<label>[2]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Stefan]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Toth]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Vigo]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The family of vehicle routing problems]]></article-title>
<source><![CDATA[Vehicle Routing: Problems, Methods and Applications]]></source>
<year>2014</year>
<publisher-loc><![CDATA[Filadelfia ]]></publisher-loc>
<publisher-name><![CDATA[Society for Industrial and Applied Mathematics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>[3]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Giraldo Páez]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Torijano]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Desarrollo de una propuesta de mejoramiento para un proceso de ruteo en una empresa comercializadora de materias primas]]></source>
<year>2014</year>
<publisher-loc><![CDATA[Cali ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Icesi]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>[4]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ballou]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Logística: Administración de la cadena de suministro]]></source>
<year>2004</year>
<publisher-loc><![CDATA[Ciudad de México ]]></publisher-loc>
<publisher-name><![CDATA[Pearson educación]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Stadtler]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Supply chain management. An overview]]></article-title>
<source><![CDATA[Supply chain management and advanced planning]]></source>
<year>2008</year>
<publisher-loc><![CDATA[Berlín ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>[6]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bao]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Cai]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Research on vehicle routing problem with soft time windows and distribution time constraints of vehicles]]></source>
<year>2010</year>
<conf-name><![CDATA[ International Conference]]></conf-name>
<conf-loc>Changzhou </conf-loc>
</nlm-citation>
</ref>
<ref id="B7">
<label>[7]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[El-Sherbeny]]></surname>
<given-names><![CDATA[N. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods]]></article-title>
<source><![CDATA[Journal of King Saud University-Science]]></source>
<year>2010</year>
<volume>22</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>123-31</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[Rocha]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Orjuela]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Una revisión al estado del arte del problema de ruteo de vehículos: Evolución histórica y métodos de solución]]></article-title>
<source><![CDATA[Revista Ingeniería]]></source>
<year>2011</year>
<volume>16</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>35-55</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>[9]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pino]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Lozano]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Villanueva]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<source><![CDATA[Estado del arte para la resolución de enrutamiento de vehículos con restricciones de capacidad]]></source>
<year>2011</year>
<conf-name><![CDATA[ International Conference on Industrial Engineering and Industrial Management]]></conf-name>
<conf-loc>Cartagena </conf-loc>
</nlm-citation>
</ref>
<ref id="B10">
<label>[10]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laporte]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Fifty years of vehicle routing]]></article-title>
<source><![CDATA[ransportation Science]]></source>
<year>2009</year>
<volume>43</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>408-16</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[Innis]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[La Londe]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Customer Service: The Key to Customer Satisfaction, Customer Loyalty, and Market Share]]></article-title>
<source><![CDATA[Journal of Business Logistics]]></source>
<year>1994</year>
<volume>15</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-27</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[Frazzon]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Albrecht]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Hurtado]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simulation-based optimization for the integrated scheduling of production and logistic systems]]></article-title>
<source><![CDATA[IFAC-PapersOnLine]]></source>
<year>2016</year>
<volume>49</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>1050-5</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[de Oliveira]]></surname>
<given-names><![CDATA[L. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Pinto]]></surname>
<given-names><![CDATA[B. R.]]></given-names>
</name>
<name>
<surname><![CDATA[de Assis]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simulation of an urban logistic space for the distribution of goods in Belo Horizonte, Brazil]]></article-title>
<source><![CDATA[Procedia-Social and Behavioral Sciences]]></source>
<year>2014</year>
<volume>125</volume>
<numero>20</numero>
<issue>20</issue>
<page-range>496-505</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[Erdo&#728;gan]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An open source spreadsheet solver for vehicle routing problems]]></article-title>
<source><![CDATA[Computers and Operations Research]]></source>
<year>2017</year>
<volume>84</volume>
<page-range>62-72</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>[15]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Oyola]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Arntzen]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Woodruff]]></surname>
<given-names><![CDATA[D. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The stochastic vehicle routing problem, a literature review, part II:solution methods]]></article-title>
<source><![CDATA[EURO Journal on Transportation and Logistics]]></source>
<year>2017</year>
<volume>6</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>349-88</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>[16]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pop]]></surname>
<given-names><![CDATA[P. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Fuksz]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Marc]]></surname>
<given-names><![CDATA[A. H.]]></given-names>
</name>
</person-group>
<source><![CDATA[A variable neighborhood search approach for solving the generalized vehicle routing problem]]></source>
<year>2014</year>
<conf-name><![CDATA[ International Conference on Hybrid Artificial Intelligence Systems, Cham]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B17">
<label>[17]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Majercakova]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Majercak]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Application of Clarke-Wright method for solving routing problem in distribution logistics]]></article-title>
<source><![CDATA[Logi. Scientific Journal on Transport and Logistics]]></source>
<year>2015</year>
<volume>6</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>90-9</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[Anghinolfi]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Paolucci]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Tonelli]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Vehicle Routing Problem with Time Windows Approach for Planning Service Operations in Gas Distribution Network of a Metropolitan Area]]></article-title>
<source><![CDATA[IFAC-PapersOnLine]]></source>
<year>2016</year>
<volume>49</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>1365-70</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[Cañedo]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Curbelo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Núñez]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Zamora]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Los procedimientos de un Sistema de Gestión de Información: Un estudio de caso de la Universidad de Cienfuegos]]></article-title>
<source><![CDATA[Biblios. Revista de Bibliotecología y Ciencias de la Información]]></source>
<year>2012</year>
<numero>46</numero>
<issue>46</issue>
</nlm-citation>
</ref>
<ref id="B20">
<label>[20]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hoff]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Andersson]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Christiansen]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hasle]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Løkketangen]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Industrial aspects and literature survey: Fleet composition and routing]]></article-title>
<source><![CDATA[Computers and Operations Research]]></source>
<year>2010</year>
<volume>37</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>2041-61</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[Rand]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The life and times of the Savings Method for Vehicle Routing Problems]]></article-title>
<source><![CDATA[ORION]]></source>
<year>2009</year>
<volume>25</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>125-45</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>[22]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Desrochers]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Lenstra]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Soumis]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Vehicle routing with time windows: Optimization and approximation]]></article-title>
<source><![CDATA[Vehicle routing: Methods and studies]]></source>
<year>1988</year>
<publisher-loc><![CDATA[Amsterdam ]]></publisher-loc>
<publisher-name><![CDATA[North-Holland]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<label>[23]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cordeau]]></surname>
<given-names><![CDATA[J. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Desaulniers]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Desrosiers]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Solomon]]></surname>
<given-names><![CDATA[M. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Soumis]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[VRP with time Windows&#8221;, en The vehicle routing problem]]></source>
<year>2002</year>
<page-range>157-93</page-range><publisher-loc><![CDATA[Filadelfia ]]></publisher-loc>
<publisher-name><![CDATA[Society for Industrial and Applied Mathematics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<label>[24]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Solomon]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Algorithms for the vehicle routing and scheduling problem 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="B25">
<label>[25]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[ity]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[vehicle routing problem (city VRP)]]></article-title>
<source><![CDATA[IEEE Transactions on Intelligent Transportation Systems]]></source>
<year>2015</year>
<volume>16</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1654-66</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>[26]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Islam]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ghosh]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Rahman]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving Capacitated Vehicle Routing Problem by Using Heuristic Approaches:A Case Study]]></article-title>
<source><![CDATA[Journal of Modern Science and Technology]]></source>
<year>2015</year>
<volume>3</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>135-46</page-range></nlm-citation>
</ref>
<ref id="B27">
<label>[27]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Muñuzuri]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Grosso]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Cortes]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Guadix]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Estimating the extracosts imposed on delivery vehicles using access time windows in a city]]></article-title>
<source><![CDATA[Computers, Environment and Urban Systems]]></source>
<year>2013</year>
<volume>41</volume>
<page-range>262-75</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
