<?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>2227-1899</journal-id>
<journal-title><![CDATA[Revista Cubana de Ciencias Informáticas]]></journal-title>
<abbrev-journal-title><![CDATA[Rev cuba cienc informat]]></abbrev-journal-title>
<issn>2227-1899</issn>
<publisher>
<publisher-name><![CDATA[Editorial Ediciones Futuro]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S2227-18992021000500086</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Planificación eficiente de rutas de distribución. Caso de estudio de una tienda virtual]]></article-title>
<article-title xml:lang="en"><![CDATA[Towards more efficient delivery routes. A virtual store case study]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Suárez]]></surname>
<given-names><![CDATA[Luis]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Porras]]></surname>
<given-names><![CDATA[Cynthia]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Díaz-Pando]]></surname>
<given-names><![CDATA[Humberto]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Sánchez-Ansola]]></surname>
<given-names><![CDATA[Eduardo]]></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 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-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Tecnológica de la Habana &#8221;José Antonio Echeverría&#8221;  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>00</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>00</month>
<year>2021</year>
</pub-date>
<volume>15</volume>
<numero>4</numero>
<fpage>86</fpage>
<lpage>100</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S2227-18992021000500086&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S2227-18992021000500086&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S2227-18992021000500086&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN La mayoría de las situaciones que involucran una cadena de distribución pueden ser modeladas como el Problema de Ruteo de Vehículos. En los últimos años las tiendas virtuales han ganado popularidad en Cuba, destacándose la plataforma TuEnvio. Actualmente, la plataforma carece de un sistema que le permita la obtención de rutas óptimas para la entrega de compras a un gran número de clientes. En este artículo se propone la solución del Problema de Ruteo de Vehículos a partir del problema p-Median Capacitado en combinación con el Problema del Agente Viajero. Para la solución de instancias grandes del problema, se proponen tres estrategias de descomposición para resolver el Problema de Ruteo de Vehículos. El método de solución consiste en dividir grandes instancias del VRP en subinstancias más pequeñas haciendo uso de la información geográfica de los nodos. Cada subinstancia es resuelta agrupando cada nodo en su ruta correspondiente resolviendo el problema p-Median Capacitado utilizando Búsqueda Local Iterada. La secuencia de recorrido de cada nodo dentro de su ruta correspondiente es determinada resolviendo el Problema del Agente Viajero utilizando la heurística Farthest Insertion. La solución propuesta es validada mediante un caso de estudio en el contexto de la entrega de paquetes de la tienda en virtual TuEnvío, en La Habana, Cuba. Los resultados obtenidos indican que dividiendo la instancia original por municipios se obtienen rutas de menor recorrido, pero descomponiendo la instancia recursivamente resolviendo el problema p-Median para determinar las subinstancias requiere un menor esfuerzo computacional y obtiene rutas de longitud aceptable.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT Most situations involving a distribution chain can be modeled as a Vehicle Routing Problem. The past few years virtual stores have gained a lot of popularity in Cuba, specially the platform TuEnvio. Currently, the platform lacks a system to optimize delivery routes for a large number of clients. To solve this Vehicle Rou- ting Problem, a mix of Capacitated p-Median problem and the Traveling Salesman Problem is proposed. To solve large instances of the Vehicle Routing Problem, three instance decomposition strategies are proposed. The solution method consists in dividing a large instances of the problem into smaller sub-instances using the geographic information of the nodes. Each sub-instance is then solved clustering all nodes in their correspon- ding route solving the Capacitated P-Median problem through Iterated Local Search. The sequence of each node in their corresponding route is determined by solving the TSP using the Farthest Insertion heuristic. The proposed solution is applied to a case study in the context of package delivery of the virtual store TuEnvio, in Havana, Cuba. The obtained results indicate that dividing the original instance by municipalities results in smaller routes, but decomposing the instances by recursively solving the P-Median problem to determine the sub-instances takes considerably less computational effort and obtains routes of acceptable length.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Problema de Ruteo de Vehículos Capacitado]]></kwd>
<kwd lng="es"><![CDATA[P-Median Problem]]></kwd>
<kwd lng="es"><![CDATA[Descomposición de instancias]]></kwd>
<kwd lng="en"><![CDATA[Capacitated Vehicle Routing Problem]]></kwd>
<kwd lng="en"><![CDATA[P-Median Problem]]></kwd>
<kwd lng="en"><![CDATA[Instance decomposition]]></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[Agárdi]]></surname>
<given-names><![CDATA[Anita]]></given-names>
</name>
<name>
<surname><![CDATA[Kovács]]></surname>
<given-names><![CDATA[László]]></given-names>
</name>
<name>
<surname><![CDATA[Bányai]]></surname>
<given-names><![CDATA[Tamás]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The fitness landscape analysis of the ant colony system algorithm in solving a vehicle routing problem.]]></article-title>
<source><![CDATA[ACADEMIC JOURNAL OF MANUFACTURING ENGI- NEERING]]></source>
<year>2021</year>
<volume>19</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cattaruzza]]></surname>
<given-names><![CDATA[Diego]]></given-names>
</name>
<name>
<surname><![CDATA[Absi]]></surname>
<given-names><![CDATA[Nabil]]></given-names>
</name>
<name>
<surname><![CDATA[Feillet]]></surname>
<given-names><![CDATA[Dominique]]></given-names>
</name>
<name>
<surname><![CDATA[Gonzalez-Feliu]]></surname>
<given-names><![CDATA[Jesus]]></given-names>
</name>
</person-group>
<source><![CDATA[Vehicle routing problems for city logistics]]></source>
<year>2017</year>
<volume>6</volume>
<page-range>51-79</page-range><publisher-name><![CDATA[EURO Journal on Transportation and Logistics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Santos Correa]]></surname>
<given-names><![CDATA[Elon]]></given-names>
</name>
<name>
<surname><![CDATA[Steiner]]></surname>
<given-names><![CDATA[Maria Teresinha]]></given-names>
</name>
<name>
<surname><![CDATA[Freitas]]></surname>
<given-names><![CDATA[Alex A]]></given-names>
</name>
<name>
<surname><![CDATA[Carnieri]]></surname>
<given-names><![CDATA[Celso]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm for solving a capacitated p-median problem]]></article-title>
<source><![CDATA[Numerical Algorithms,]]></source>
<year>2004</year>
<volume>35</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>373-88</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Daskin]]></surname>
<given-names><![CDATA[Mark S]]></given-names>
</name>
<name>
<surname><![CDATA[Lee Maass]]></surname>
<given-names><![CDATA[Kayse]]></given-names>
</name>
</person-group>
<source><![CDATA[The p-median problem.]]></source>
<year>2015</year>
<publisher-name><![CDATA[Springer International Publishing, Cham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Davari]]></surname>
<given-names><![CDATA[Soheil]]></given-names>
</name>
<name>
<surname><![CDATA[Zarandi]]></surname>
<given-names><![CDATA[Mohammad]]></given-names>
</name>
<name>
<surname><![CDATA[Hemmati]]></surname>
<given-names><![CDATA[Ahmad]]></given-names>
</name>
</person-group>
<source><![CDATA[A greedy variable neighborhood search heuristic for the maximal covering location problem with fuzzy coverage radii.]]></source>
<year>2013</year>
<volume>41</volume>
<page-range>68-76</page-range><publisher-name><![CDATA[Knowledge-Based Systems]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dhaenens-Flipo]]></surname>
<given-names><![CDATA[Clarisse]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Spatial decomposition for a multi-facility production and distribution problem.]]></article-title>
<source><![CDATA[International Journal of Production Economics]]></source>
<year>2000</year>
<volume>64</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>177-86</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Erdog&#728;an]]></surname>
<given-names><![CDATA[Gu¨nes¸]]></given-names>
</name>
<name>
<surname><![CDATA[Laporte]]></surname>
<given-names><![CDATA[Gilbert]]></given-names>
</name>
<name>
<surname><![CDATA[Rodríguez Chía]]></surname>
<given-names><![CDATA[Antonio M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Exact and heuristic algorithms for the hamiltonian p-median problem.]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2016</year>
<volume>253</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>280-9</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fajardo]]></surname>
<given-names><![CDATA[Jenny]]></given-names>
</name>
</person-group>
<source><![CDATA[Soft Computing en Problemas de Optimización Dinámicos]]></source>
<year>2015</year>
<publisher-name><![CDATA[Granada University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fleszar]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Hindi]]></surname>
<given-names><![CDATA[K.S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An effective vns for the capacitated p-median problem]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2008</year>
<volume>191</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>612-22</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Flood]]></surname>
<given-names><![CDATA[Merrill M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The traveling-salesman problem]]></article-title>
<source><![CDATA[Operations Research]]></source>
<year>1956</year>
<volume>4</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>61-75</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Golden]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
<name>
<surname><![CDATA[Bodin]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Doyle]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Stewart]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Approximate traveling salesman algorithms.]]></article-title>
<source><![CDATA[Operations Research]]></source>
<year>1980</year>
<volume>28</volume>
<numero>3-part-ii</numero>
<issue>3-part-ii</issue>
<page-range>694-711</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Luxen]]></surname>
<given-names><![CDATA[Dennis]]></given-names>
</name>
<name>
<surname><![CDATA[Vetter]]></surname>
<given-names><![CDATA[Christian]]></given-names>
</name>
</person-group>
<source><![CDATA[Real-time routing with openstreetmap data]]></source>
<year>2011</year>
<page-range>513-6</page-range><publisher-name><![CDATA[Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Caballero Morales]]></surname>
<given-names><![CDATA[Santiago Omar]]></given-names>
</name>
<name>
<surname><![CDATA[Rahim]]></surname>
<given-names><![CDATA[Abdur]]></given-names>
</name>
</person-group>
<source><![CDATA[Heuristic for the capacitated p-median problem under a cvrp approach]]></source>
<year>2017</year>
<publisher-name><![CDATA[7th Annual International Conference on Industrial Engineering and Operations Manage- ment,]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aginta Putri]]></surname>
<given-names><![CDATA[Karina]]></given-names>
</name>
<name>
<surname><![CDATA[Layli Rachmawati]]></surname>
<given-names><![CDATA[Nur]]></given-names>
</name>
<name>
<surname><![CDATA[Lusiani]]></surname>
<given-names><![CDATA[Mirna]]></given-names>
</name>
<name>
<surname><![CDATA[Agung]]></surname>
<given-names><![CDATA[Anak]]></given-names>
</name>
<name>
<surname><![CDATA[Perwira Redi]]></surname>
<given-names><![CDATA[Ngurah]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Genetic algorithm with cluster-first route-second to solve the capacitated vehicle routing problem with time win- dows: A case study.]]></article-title>
<source><![CDATA[Jurnal Teknik Industri]]></source>
<year>2021</year>
<volume>23</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>75-82</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ralphs]]></surname>
<given-names><![CDATA[T.K]]></given-names>
</name>
<name>
<surname><![CDATA[Kopman]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Pulleyblank]]></surname>
<given-names><![CDATA[W.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Trotter]]></surname>
<given-names><![CDATA[L.E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the capacitated vehicle routing pro- blem.]]></article-title>
<source><![CDATA[Mathematical Programming]]></source>
<year>2003</year>
<volume>94</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>343-59</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reimann]]></surname>
<given-names><![CDATA[Marc]]></given-names>
</name>
<name>
<surname><![CDATA[Doerner]]></surname>
<given-names><![CDATA[Karl]]></given-names>
</name>
<name>
<surname><![CDATA[Hartl]]></surname>
<given-names><![CDATA[Richard F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[D-ants: Savings based ants divide and conquer the vehicle routing problem.]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2004</year>
<volume>31</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>563-91</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rizkallah]]></surname>
<given-names><![CDATA[Lydia]]></given-names>
</name>
<name>
<surname><![CDATA[Farouk]]></surname>
<given-names><![CDATA[Mona]]></given-names>
</name>
<name>
<surname><![CDATA[Darwish]]></surname>
<given-names><![CDATA[Nevin]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A clustering algorithm for solving the vehicle routing assignment problem in polynomial time.]]></article-title>
<source><![CDATA[International Journal of Engineering and Technology]]></source>
<year>2019</year>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ung Sun]]></surname>
<given-names><![CDATA[Ji]]></given-names>
</name>
</person-group>
<source><![CDATA[A two-phase meta heuristic approach to the location-routing problem for transportation network planning.]]></source>
<year>2013</year>
<volume>361</volume>
<page-range>1900-5</page-range><publisher-name><![CDATA[Sustainable Cities Development and Environment Protection]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bankian Tabrizi]]></surname>
<given-names><![CDATA[Behzad]]></given-names>
</name>
<name>
<surname><![CDATA[Jabalameli]]></surname>
<given-names><![CDATA[M. Saeed]]></given-names>
</name>
<name>
<surname><![CDATA[Moshref Javadi]]></surname>
<given-names><![CDATA[Mohammad]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A simulated annealing method to solve a generalized maximal covering location problem.]]></article-title>
<source><![CDATA[International Journal of Industrial Engineering Computations]]></source>
<year>2011</year>
<volume>2</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>439-48</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<collab>Taillard</collab>
<article-title xml:lang=""><![CDATA[Parallel iterative search methods for vehicle routing problems]]></article-title>
<source><![CDATA[Networks]]></source>
<year>1993</year>
<volume>23</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>661-73</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Talbi]]></surname>
<given-names><![CDATA[El-Ghazali]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheuristics: from design to implementation]]></source>
<year>2009</year>
<volume>74</volume>
<publisher-name><![CDATA[John Wiley &amp; Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Whitaker]]></surname>
<given-names><![CDATA[R.A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A fast algorithm for the greedy interchange for large-scale clustering and median location problems.]]></article-title>
<source><![CDATA[INFOR: Information Systems and Operational Research]]></source>
<year>1983</year>
<volume>21</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>95-108</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
