<?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-1129</journal-id>
<journal-title><![CDATA[Revista Facultad de Ingeniería]]></journal-title>
<abbrev-journal-title><![CDATA[Rev. Fac. ing.]]></abbrev-journal-title>
<issn>0121-1129</issn>
<publisher>
<publisher-name><![CDATA[Universidad Pedagógica y Tecnológica de Colombia]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0121-11292017000200009</article-id>
<article-id pub-id-type="doi">10.19053/01211129.v26.n45.2017.6052</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A methodology for creating Feeding routes in mass transit systems]]></article-title>
<article-title xml:lang="es"><![CDATA[Metodología poro croar rutas alimentadoras en sistemas de transporte masivo]]></article-title>
<article-title xml:lang="pt"><![CDATA[Metodologia para criar rotas alimentadoras em sistemas de transporte masivo]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ospina-Toro]]></surname>
<given-names><![CDATA[Daniela]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<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[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  ]]></institution>
<addr-line><![CDATA[Pereira Risaralda]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Tecnológica de Pereira  ]]></institution>
<addr-line><![CDATA[Pereira Risaralda]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Tecnológica de Pereira  ]]></institution>
<addr-line><![CDATA[Pereira Risaralda]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>08</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>08</month>
<year>2017</year>
</pub-date>
<volume>26</volume>
<numero>45</numero>
<fpage>9</fpage>
<lpage>21</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0121-11292017000200009&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-11292017000200009&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-11292017000200009&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract This paper proposes a methodology to identify feeding routes for areas disconnected to the Mass Transit System (MTS), in order to propose an alternative solution to the deficit in the number of carried passengers. The proposed methodology consists of two steps: (1) structuring scenarios for areas disconnected from the transport system, and (2) combining heuristic and exact techniques to solve the feeding routes problem. The methodology considers among its restrictions the path length and the passenger vehicle capacity. To model the problem, a comparison with the Location Routing Problem (LRP), which is usually applied to freight transport problems, was established. The proposed methodology is a math-heuristic that combines the Lin-Kernighan-Helsgaun algorithm (LKH), and the Clark and Wright's Savings heuristic with the Branch-and-Cut exact algorithm, which is applied into a Mixed Integer Linear Programming model (MILP), also known as a Set Partitioning model (SP) for LRP. This methodological approach is validated with real instances in the massive transport system of Pereira (Megabús), considering some areas disconnected from the Central-Occidental Metropolitan Area System (AMCO) of Pereira, located in the Colombia's Coffee Axis.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen Se propone una metodología para identificar rutas alimentadoras en zonas no conectadas para un sistema de transporte masivo, con el fin de aumentar la cobertura del servicio y mejorar el nivel de ocupación del sistema. La metodología propuesta consta de dos etapas: 1) estructurar escenarios de áreas no conectadas al sistema de transporte y 2) combinar técnicas heurísticas y exactas para resolver el problema de rutas alimentadoras. La metodología considera dentro de sus restricciones la duración de la ruta y la capacidad del vehículo alimentador. Para su modelamiento se establece una analogía entre los problemas del transporte de pasajeros y el problema de localización y ruteo, Location Routing Problem (LRP), que usualmente es aplicado a problemas de transporte de mercancías. La metodología de solución propuesta es una matheurística que combina las heurísticas Lin-Kernighan-Helsgaun (LKH) y ahorros con el algoritmo de ramificación y corte, Branch-and-Cut, aplicado sobre un modelo lineal entero mixto de partición de conjuntos (Set Partitioning) para LRP. Esta propuesta metodológica es validada con casos de prueba reales del sistema de transporte masivo de la ciudad de Pereira (Megabús), donde se consideran algunas zonas no conectadas del Área Metropolitana Centro Occidente, localizada en el eje cafetero colombiano.]]></p></abstract>
<abstract abstract-type="short" xml:lang="pt"><p><![CDATA[Resumo Propõe-se uma metodologia para identificar rotas alimentadoras em áreas não conectadas para um sistema de transporte massivo, com o fim de aumentar a cobertura do serviço e melhorar o nível de ocupação do sistema. A metodologia proposta consta de duas etapas: 1) estruturar cenários de áreas não conectadas ao sistema de transporte e 2) combinar técnicas heurísticas e exatas para resolver o problema de rotas alimentadoras. A metodologia considera, dentro de suas restrições, a duração da rota e a capacidade do veículo alimentador. Para seu modelamento estabelece-se uma analogia entre os problemas do transporte de passageiros e o problema de localização e roteamento, Location Routing Problem (LRP), que usualmente é aplicado a problemas de transporte de mercadorias. A metodologia de solução proposta é uma matheurística que combina as heurísticas Lin-Kernighan-Helsgaun (LKH) e economias com o algoritmo de ramificação e corte Branch-and-Cut, aplicado sobre um modelo lineal inteiro misto de partição de conjuntos (Set Partitioning) para LRP. Esta proposta metodológica é validada com casos de prova reais do sistema de transporte massivo da cidade de Pereira (Megabús), onde se consideram algumas regiões não conectadas da Área Metropolitana Centro Ocidente, localizada no Eje Cafetero colombiano.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Feeding Routes]]></kwd>
<kwd lng="en"><![CDATA[LKH algorithm]]></kwd>
<kwd lng="en"><![CDATA[Location Routing Problem]]></kwd>
<kwd lng="en"><![CDATA[Math-Heuristic]]></kwd>
<kwd lng="en"><![CDATA[Savings Algorithm]]></kwd>
<kwd lng="en"><![CDATA[Set-Partitioning model]]></kwd>
<kwd lng="es"><![CDATA[Heurística de ahorros]]></kwd>
<kwd lng="es"><![CDATA[Heurística LKH]]></kwd>
<kwd lng="es"><![CDATA[Math-heurística]]></kwd>
<kwd lng="es"><![CDATA[Modelo de partición de conjuntos]]></kwd>
<kwd lng="es"><![CDATA[Problema de localización y ruteo]]></kwd>
<kwd lng="es"><![CDATA[Rutas alimentadoras]]></kwd>
<kwd lng="pt"><![CDATA[Heurística de economia]]></kwd>
<kwd lng="pt"><![CDATA[Heurística LKH]]></kwd>
<kwd lng="pt"><![CDATA[Matheurística]]></kwd>
<kwd lng="pt"><![CDATA[Modelo de partição de conjuntos]]></kwd>
<kwd lng="pt"><![CDATA[Problema de localização e roteamento]]></kwd>
<kwd lng="pt"><![CDATA[Rotas alimentadoras]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>[1]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Thomson]]></surname>
<given-names><![CDATA[I]]></given-names>
</name>
</person-group>
<source><![CDATA[Impacto de las tendencias sociales, económicas y tecnológicas sobre el transporte público: investigación preliminar en ciudades de América Latina]]></source>
<year>2002</year>
<publisher-name><![CDATA[United Nations Publications]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>[2]</label><nlm-citation citation-type="book">
<collab>Ministerio de Transporte de Colombia</collab>
<source><![CDATA[Política para mejorar el servicio de transporte Público urbano de pasajeros]]></source>
<year>2002</year>
<publisher-name><![CDATA[Consejo Nacional de Política Económica y Social, CONPES 3167, Departamento Nacional de Planeación]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>[3]</label><nlm-citation citation-type="book">
<collab>Ministerio de Transporte de Colombia</collab>
<source><![CDATA[Política Nacional de Transporte Urbano y Masivo]]></source>
<year>2003</year>
<publisher-name><![CDATA[Consejo Nacional de Política Económica y Social, CONPES 3260, DEPARTAMENTO NACIONAL DE PLANEACIÓN]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>[4]</label><nlm-citation citation-type="">
<collab>El Tiempo</collab>
<source><![CDATA["Ninguno de los 'Transmilenios' del país se salva de líos financieros]]></source>
<year>2013</year>
</nlm-citation>
</ref>
<ref id="B5">
<label>[5]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Anson]]></surname>
<given-names><![CDATA[M. J]]></given-names>
</name>
<name>
<surname><![CDATA[Fabozzi]]></surname>
<given-names><![CDATA[F. J]]></given-names>
</name>
<name>
<surname><![CDATA[Jones]]></surname>
<given-names><![CDATA[F. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[The handbook of traditional and alternative investment vehicles: investment characteristics and strategies]]></source>
<year>2010</year>
<volume>194</volume>
<publisher-name><![CDATA[John Wiley &amp; Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>[6]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Blumstein]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Beck]]></surname>
<given-names><![CDATA[A. J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["Population growth in US prisons, 1980-1996,"]]></article-title>
<source><![CDATA[Crime. &amp; Just]]></source>
<year>1999</year>
<volume>26,</volume>
<page-range>17-61</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>[7]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Grossman]]></surname>
<given-names><![CDATA[J. W]]></given-names>
</name>
</person-group>
<source><![CDATA["Patterns of collaboration in mathematical research,"]]></source>
<year>2002</year>
<volume>35</volume>
<page-range>8-9</page-range><publisher-name><![CDATA[SIAM News]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>[8]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laporte]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Nobert]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Arpin]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["An exact algorithm for solving a capacitated location-routing problem,"]]></article-title>
<source><![CDATA[Annals of Operations Research]]></source>
<year>1986</year>
<volume>6</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>291-310</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>[9]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Prodhon]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["A memetic algorithm with population management (MA| PM) for the periodic location-routing problem,"]]></article-title>
<source><![CDATA[Lecture Notes in Computer Science]]></source>
<year>2008</year>
<volume>5296</volume>
<page-range>43-57</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>[10]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nagy]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Salhi]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["Location-routing: Issues, models and methods,"]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2007</year>
<volume>177</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>649-72</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[Salhi]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Rand]]></surname>
<given-names><![CDATA[G. K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["The effect of ignoring routes when locating depots,"]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>1989</year>
<volume>39</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>150-6</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[Tuzun]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Burke]]></surname>
<given-names><![CDATA[L. I]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["A two-phase tabu search approach to the location routing problem,"]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>1999</year>
<volume>116</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>87-99</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[Albareda-Sambola]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Diaz]]></surname>
<given-names><![CDATA[J. A]]></given-names>
</name>
<name>
<surname><![CDATA[Fernández]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["A compact model and tight bounds for a combined location-routing problem,"]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2005</year>
<volume>32</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>407-28</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>[14]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Melechovsky]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Calvo]]></surname>
<given-names><![CDATA[R. W]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["A metaheuristic to solve a location-routing problem with non-linear costs,"]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>2005</year>
<volume>11</volume>
<numero>5-6</numero>
<issue>5-6</issue>
<page-range>375-91</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[Barreto]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Ferreira]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Paixao]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Santos]]></surname>
<given-names><![CDATA[B. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["Using clustering analysis in a capacitated location-routing problem,"]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2007</year>
<volume>179</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>968-77</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>[16]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Prodhon]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Ruiz]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Soriano]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Wolfler Calvo]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic,"]]></article-title>
<source><![CDATA[Transportation Science]]></source>
<year>2007</year>
<volume>41</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>470-83</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>[17]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Prodhon]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["An elsxpath relinking hybrid for the periodic location-routing problem,"]]></article-title>
<source><![CDATA[Lecture Notes in Computer Science,]]></source>
<year>2009</year>
<volume>5818</volume>
<page-range>15-29</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[Prodhon]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["A hybrid evolutionary algorithm for the periodic location-routing problem,"]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2011</year>
<volume>210</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>204-12</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[Duhamel]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Lacomme]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Prodhon]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A GRASP* ELS approach for the capacitated location-routing problem,"]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2010</year>
<volume>37</volume>
<page-range>1912-23</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>[20]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Escobar]]></surname>
<given-names><![CDATA[J. W]]></given-names>
</name>
<name>
<surname><![CDATA[Linfati]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Toth]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["A two-phase hybrid heuristic algorithm for the capacitated location-routing problem,"]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2013</year>
<volume>40</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>70-9</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>[21]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pirkwieser]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Raidl]]></surname>
<given-names><![CDATA[G. R]]></given-names>
</name>
</person-group>
<source><![CDATA[Variable neighborhood search coupled with ILP-based very large neighborhood searches for the (periodic) location-routing problem: Springer]]></source>
<year>2010</year>
</nlm-citation>
</ref>
<ref id="B22">
<label>[22]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[Z.-Z]]></given-names>
</name>
<name>
<surname><![CDATA[Yao]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["An improved ant colony optimization for vehicle routing problem,"]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2009</year>
<volume>196</volume>
<page-range>171-6</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>[23]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hemmelmayr]]></surname>
<given-names><![CDATA[V. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Cordeau]]></surname>
<given-names><![CDATA[J.-F]]></given-names>
</name>
<name>
<surname><![CDATA[Crainic]]></surname>
<given-names><![CDATA[T. G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics,"]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2012</year>
<volume>39</volume>
<page-range>3215-28</page-range></nlm-citation>
</ref>
<ref id="B24">
<label>[24]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Berger]]></surname>
<given-names><![CDATA[R. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Coullard]]></surname>
<given-names><![CDATA[C. R]]></given-names>
</name>
<name>
<surname><![CDATA[Daskin]]></surname>
<given-names><![CDATA[M. S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["Location-routing problems with distance constraints,"]]></article-title>
<source><![CDATA[Transportation Science]]></source>
<year>2007</year>
<volume>41</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>29-43</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[Akca]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Berger]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Ralphs]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["A branch-and-price algorithm for combined location and routing problems under capacity restrictions,"]]></article-title>
<source><![CDATA[Operations Research and Cyber-Infrastructure]]></source>
<year>2009</year>
<page-range>309-30</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[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[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>
<article-title xml:lang=""><![CDATA["A branch-and-cut method for the capacitated location-routing problem,"]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2011</year>
<volume>38</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>931-41</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[Prodhon]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["A survey of recent research on location-routing problems,"]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2014</year>
<volume>238</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-17</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>[28]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Clarke]]></surname>
<given-names><![CDATA[G. U]]></given-names>
</name>
<name>
<surname><![CDATA[Wright]]></surname>
<given-names><![CDATA[J. W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["Scheduling of vehicles from a central depot to a number of delivery points,"]]></article-title>
<source><![CDATA[Operations Research]]></source>
<year>1964</year>
<volume>12</volume>
<page-range>568-81</page-range></nlm-citation>
</ref>
<ref id="B29">
<label>[29]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Helsgaun]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["An effective implementation of the Lin-Kernighan traveling salesman heuristic,"]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2000</year>
<volume>126</volume>
<page-range>106-30</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>[30]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
<name>
<surname><![CDATA[Ma]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA["An effective genetic algorithm for the fleet size and mix vehicle routing problems,"]]></article-title>
<source><![CDATA[Transportation Research Part E: Logistics and Transportation Review,]]></source>
<year>2009</year>
<volume>45</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>434-45</page-range></nlm-citation>
</ref>
<ref id="B31">
<label>[31]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Giraldo]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Caicedo]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Construcción de matriz origen destino de transporte para amco]]></source>
<year>2010</year>
<publisher-loc><![CDATA[Pereira ]]></publisher-loc>
<publisher-name><![CDATA[), Facultad de Ingeniería Industrial. Universidad Tecnológica de Pereira]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B32">
<label>[32]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carmona]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
<name>
<surname><![CDATA[Guillen]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<source><![CDATA[Estudio de factibilidad para la creación de rutas exclusivas de transporte en los municipios de Pereira y Dosquebradas para la comunidad estudiantil de jornada diurna de la Universidad Tecnológica de Pereira,]]></source>
<year>2014</year>
<publisher-loc><![CDATA[Pereira ]]></publisher-loc>
<publisher-name><![CDATA[Ingeniería Industrial, Universidad Tecnológica de Pereira]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
