<?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>1405-7743</journal-id>
<journal-title><![CDATA[Ingeniería, investigación y tecnología]]></journal-title>
<abbrev-journal-title><![CDATA[Ing. invest. y tecnol.]]></abbrev-journal-title>
<issn>1405-7743</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Facultad de Ingeniería]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-77432016000300357</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Modelo matemático para resolver el problema de localización y ruteo con restricciones de capacidad considerando flota propia y subcontratada]]></article-title>
<article-title xml:lang="en"><![CDATA[Mathematical Model for Capacitated Location Routing Problem with Private Fleet and Common Carrier]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Toro-Ocampo]]></surname>
<given-names><![CDATA[Eliana Mirledy]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Franco-Baquero]]></surname>
<given-names><![CDATA[John Fredy]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gallego-Rendón]]></surname>
<given-names><![CDATA[Ramón Alfonso]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Tecnológica de Pereira Facultad de Ingeniería Industrial ]]></institution>
<addr-line><![CDATA[Risaralda ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidade Estadual Paulista Julio de Mesquita Filho Facultad de Ingeniería Departamento de Ingeniería Eléctrica]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Brazil</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Tecnológica de Pereira Facultad de Ingenierías ]]></institution>
<addr-line><![CDATA[Risaralda ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2016</year>
</pub-date>
<volume>17</volume>
<numero>3</numero>
<fpage>357</fpage>
<lpage>369</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-77432016000300357&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-77432016000300357&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-77432016000300357&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen: El problema de localización y ruteo con restricciones de capacidad (CLRP) consiste en la selección de depósitos y rutas para atender un conjunto de clientes para obtener el mínimo costo. Una variante de este problema, en la que se considera existe la posibilidad de subcontratar la operación de algunas (o todas) las rutas, es el problema de localización y ruteo con flota propia y flota subcontratada (CLRPPC). Este problema aparece cuando la flota propia es insuficiente para atender la totalidad de la demanda, o una parte de los vehículos de la flota propia debe atender actividades de mantenimiento y reparación. El objetivo del CLRPPC es minimizar los costos de apertura de los centros de distribución (CD), el costo de uso de los vehículos propios y los costos variables asociados a la utilización de las rutas recorridas por la flota propia o por la flota subcontratada. En este artículo se presenta un nuevo modelo matemático para el CLRPPC, en el que las restricciones clásicas para evitar los sub-tours se reemplazan por un conjunto de restricciones que establecen conexiones radiales entre los clientes y los depósitos, permi- tiendo resolver de forma exacta instancias de la literatura especializada usando solvers comerciales. El modelo además puede adaptarse para resolver el problema de ruteo atendido con flota propia y subcontratada (VRPPC) y con múltiples depósitos (MDVRPPC). Los modelos se validan con instancias de la literatura especializada, donde los resultados demuestran que la formulación propuesta permite obtener resultados satisfactorios para estos tres tipos de problemas a pesar de su alta complejidad matemática.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: The Capacitated Location Routing Problem (CLRP) consists in the selection of depots and routes to serve all the clients such that the minimum cost is obtained. A variant of this problem, where it is considered that there is the possibility of outsourcing the operation of some (or all) routes, is the location routing problem with private fleet and common carrier (CLRPPC). This problem is presented when the own fleet is insufficient to serve the whole demand or part of its own fleet must have maintenance and repairing activities. The CLRPPC objective is to minimize the costs of opening distribution centers (DC), the cost for using their own vehicles and the variable costs associated with the use of the routes traveled by their own fleet or an outsourced fleet. This paper presents a new mathematical model for CLRPPC, where the classical restrictions to prevent sub-tours are replaced by a set of constraints that establish the radio links between customers and depots, solving accurately instances used in the literature using commercial solvers. Moreover, the model can be adapted to solve the Vehicle Routing Problem with Private Fleet and Common Carrier (VRPPC) and Multi-Depot Vehicle Routing Problem with Private Fleet and Common Carrier (MDVRPPC). The models are validated with instances of the literature, where the results show that the proposed formulation gives satisfactory results for these three types of problems despite its high mathematical complexity.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[estrategia de distribución]]></kwd>
<kwd lng="es"><![CDATA[flota propia]]></kwd>
<kwd lng="es"><![CDATA[flota subcontratada]]></kwd>
<kwd lng="es"><![CDATA[problema de localización y ruteo con restricciones de capacidad]]></kwd>
<kwd lng="es"><![CDATA[problema de ruteo multi-depósito]]></kwd>
<kwd lng="es"><![CDATA[ruteo de vehículos]]></kwd>
<kwd lng="en"><![CDATA[capacitated location routing problem]]></kwd>
<kwd lng="en"><![CDATA[common carrier]]></kwd>
<kwd lng="en"><![CDATA[distribution strategy]]></kwd>
<kwd lng="en"><![CDATA[multi-depot vehicle routing problem]]></kwd>
<kwd lng="en"><![CDATA[own fleet]]></kwd>
<kwd lng="en"><![CDATA[outsourced fleet]]></kwd>
<kwd lng="en"><![CDATA[vehicle routing problem]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Separating capacity inequalities in the CVRP using Tabu Search]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Augerat]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Belenguer]]></surname>
<given-names><![CDATA[J.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Benavent]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Corberán]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Nadeff]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>1998</year>
<volume>106</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>546-57</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Planning for truck fleet size in the presence of a common-carrier option]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ball]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Golden]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Assad]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Bodin]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Decision Sciences]]></source>
<year>1983</year>
<volume>14</volume>
<page-range>103-20</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A heuristic for the routing and carrier selection problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bolduc]]></surname>
<given-names><![CDATA[M.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Renaud]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Boctor]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal Operations Research]]></source>
<year>2007</year>
<volume>183</volume>
<page-range>926-32</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bolduc]]></surname>
<given-names><![CDATA[M.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Renaud]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Boctor]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Laporte]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal Operations Research Society]]></source>
<year>2008</year>
<volume>59</volume>
<page-range>776-87</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A heuristic algorithm for the truckload and less thantruckload problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chu]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal Operations Research]]></source>
<year>2005</year>
<volume>165</volume>
<page-range>657-67</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chu]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Chang]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Chang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[A heuristic algorithm for the multidepot vehicle routing problem with outsider carrier selection]]></source>
<year>2007</year>
<publisher-loc><![CDATA[Keelung, Taiwan ]]></publisher-loc>
<publisher-name><![CDATA[Department of shipping and Transportation Management, National Taiwan Ocean University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Scheduling of vehicles from a central depot to a number of delivery points]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Clarke]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Wright]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Operation Research]]></source>
<year>1964</year>
<volume>12</volume>
<page-range>568-81</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A tabu search heuristic for periodic and multi-depot vehicle routingproblems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cordeau]]></surname>
<given-names><![CDATA[J.F.]]></given-names>
</name>
<name>
<surname><![CDATA[Gendreau]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Laporte]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Networks]]></source>
<year>1998</year>
<volume>30</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>105-19</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A tabu search heuristic for the vehicle routing problem with private fleet and common carrier]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Côté]]></surname>
<given-names><![CDATA[J.F.]]></given-names>
</name>
<name>
<surname><![CDATA[Potvin]]></surname>
<given-names><![CDATA[J.Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal Operations Research]]></source>
<year>2009</year>
<volume>198</volume>
<page-range>464-9</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="">
<collab>CPLEX</collab>
<source><![CDATA[optimization subroutine library guide and reference, version 11.0]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fourer]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Gay]]></surname>
<given-names><![CDATA[D.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kernighan]]></surname>
<given-names><![CDATA[B.W.]]></given-names>
</name>
</person-group>
<source><![CDATA[AMPL: A Modeling Language for Mathematical Programming]]></source>
<year>2002</year>
<edition>2</edition>
<publisher-name><![CDATA[Brooks]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Fleet size planning when outside carrier service are available]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Klincewicz]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Luss]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Pilcher]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transportation Science]]></source>
<year>1990</year>
<volume>24</volume>
<page-range>169-82</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A Genetic algorithm for the routing and carrier selection problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kratica]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Kostic]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Tosic]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Dugosiga]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Filipovic]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<source><![CDATA[Com-SIS]]></source>
<year>2012</year>
<volume>9</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>49-62</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[The open vehicle routing problem: algorithms, large-scale test problems, and computational results]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Golden]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Wasi]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computers and Operations Research]]></source>
<year>2007</year>
<volume>34</volume>
<page-range>2918-30</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[The close-open mixed vehicle routing problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhibin]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational research]]></source>
<year>2012</year>
<volume>220</volume>
<page-range>349-60</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Tabu Search with ejection chains for the vehicle routing problem with private fleet and common carrier]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Potvin]]></surname>
<given-names><![CDATA[J.Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Naud]]></surname>
<given-names><![CDATA[M.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal Operations Research Society]]></source>
<year>2011</year>
<volume>62</volume>
<page-range>326-36</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Potvin]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Naud]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Journal of the operational research society]]></source>
<year>2011</year>
<volume>62</volume>
<page-range>326-36</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[The capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking,4-OR]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Prodhon]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Calvo]]></surname>
<given-names><![CDATA[R.W.]]></given-names>
</name>
</person-group>
<source><![CDATA[AQuarterly journal of Operations research]]></source>
<year>2006</year>
<volume>4</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>221-38</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A survey of recent research on location routing problems]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Prodhon]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2014</year>
<volume>128</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-17</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[An adaptative variable neighboorhod search algorithm for a vehicle routing problem arising in small package shipping]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Stenger]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Vigo]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Enz]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Schwind]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transportation Science]]></source>
<year>2013</year>
<volume>47</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>64-80</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
