<?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>1900-3803</journal-id>
<journal-title><![CDATA[Entramado]]></journal-title>
<abbrev-journal-title><![CDATA[Entramado]]></abbrev-journal-title>
<issn>1900-3803</issn>
<publisher>
<publisher-name><![CDATA[Universidad Libre de Cali]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1900-38032017000100072</article-id>
<article-id pub-id-type="doi">10.18041/entramado.2017v13n1.25105</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Modelo matemático para la planificación de servicios y programación de rutas en empresas prestadoras de servicios de control de plagas]]></article-title>
<article-title xml:lang="en"><![CDATA[Mathematical model for the services planning and scheduling of routes on companies that offer services of pest control]]></article-title>
<article-title xml:lang="pt"><![CDATA[Modelo matemático para planejamento de serviços e programação de rotas no serviço de controle de empresas de pragas]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Escobar]]></surname>
<given-names><![CDATA[John Willmer]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad del Valle  ]]></institution>
<addr-line><![CDATA[Cali ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2017</year>
</pub-date>
<volume>13</volume>
<numero>1</numero>
<fpage>72</fpage>
<lpage>77</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S1900-38032017000100072&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S1900-38032017000100072&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S1900-38032017000100072&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN Este artículo aborda el problema de la programación de servicios y planificación de rutas para empresas prestadoras de servicio de control de plagas (CP) considerando la minimización de los costos relacionados con las distancias recorridas por los vehículos usados y el costo del tiempo ocioso de los operarios. El problema considera actividades programadas, fechas de atención no disponibles, capacidad instalada, y datos de demanda previa obtenida de los clientes. La problemática consiste en la programación de los servicios y la planificación de las rutas de atención considerando ventanas de tiempo. En particular, se ha propuesto un modelo de programación lineal entera mixta, que busca mejorar la gestión logística de empresas que pertenecen a este sector. El modelo se ha probado con datos de una compañía colombiana que presta los servicios de CP en las principales ciudades colombianas. Los resultados obtenidos reflejan la importancia y eficiencia de la metodología propuesta como alternativa para la solución de la problemática en cuestión.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT This paper addresses the problem of scheduling of services and planning of routes for companies which offer the service of pest control (CP) by considering the minimization of costs related to the distance traveled by the used vehicles and the cost of the cost of idle time of operators. The problem considers scheduled activities, dates not available and installed capacity, and data of demand previously provided by the customers. The problem consists of the scheduling and planning of the routes by considering time windows. In particular it is proposed a mixed integer linear programming model to improve the logistic management process of companies belonging to this sector The model has been tested with data obtained from a Colombian company that provides the CP services in the main Colombian cities. The results show the importance and efficiency of the proposed methodology as an alternative to the solution of the considered problem.]]></p></abstract>
<abstract abstract-type="short" xml:lang="pt"><p><![CDATA[RESUMO Este artigo discute o problema do agendamento de serviços e planejamento de rota para o controle de empresas de serviços de pragas (CP), considerando a minimização de custos relacionados com as distâncias percorridas pelos veículos usados e o custo do tempo ocioso de operadores . O problema considera actividades programadas, as datas não importa disponível, capacidade e dados de demanda obtidos a partir de clientes anteriores instalado. O problema é o de serviços de programação e cuidado planeamento da rota, considerando janelas de tempo. Em particular, ele propôs um modelo de programação linear inteira mista, que visa melhorar as empresas de gestão logística pertencentes a este sector. O modelo foi testado com dados de uma empresa colombiana, que fornece serviços de CP nas principais cidades colombianas. Os resultados mostram a importância e eficiência da metodologia proposta como uma alternativa para resolver o problema em questão.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Programación de rutas]]></kwd>
<kwd lng="es"><![CDATA[problema del viajero de negocios]]></kwd>
<kwd lng="es"><![CDATA[control de plagas]]></kwd>
<kwd lng="es"><![CDATA[modelo matemático]]></kwd>
<kwd lng="es"><![CDATA[programación lineal entera mixta]]></kwd>
<kwd lng="en"><![CDATA[Routes scheduling]]></kwd>
<kwd lng="en"><![CDATA[travelling salesman problem]]></kwd>
<kwd lng="en"><![CDATA[pest control]]></kwd>
<kwd lng="en"><![CDATA[mathematical model]]></kwd>
<kwd lng="en"><![CDATA[mixed linear and integer model]]></kwd>
<kwd lng="pt"><![CDATA[Planejamento de rotas]]></kwd>
<kwd lng="pt"><![CDATA[problema viajante de negócios]]></kwd>
<kwd lng="pt"><![CDATA[controle de pragas]]></kwd>
<kwd lng="pt"><![CDATA[modelo matemático]]></kwd>
<kwd lng="pt"><![CDATA[programação linear inteira mista]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BADILLO]]></surname>
<given-names><![CDATA[Santiago]]></given-names>
</name>
</person-group>
<source><![CDATA[Un problema bi-objetivo de ruteo de vehículos con ventanas de tiempo]]></source>
<year>2011</year>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Autónoma de Nuevo León]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BALLOU]]></surname>
<given-names><![CDATA[Ronald. H]]></given-names>
</name>
</person-group>
<source><![CDATA[ogística: Administración de la Cadena de Suministro]]></source>
<year>2004</year>
<edition>5a edición ed</edition>
<publisher-loc><![CDATA[México ]]></publisher-loc>
<publisher-name><![CDATA[Pearson Educación]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BERNAL MOYANO]]></surname>
<given-names><![CDATA[Jose]]></given-names>
</name>
<name>
<surname><![CDATA[ESCOBAR]]></surname>
<given-names><![CDATA[John Willmer]]></given-names>
</name>
<name>
<surname><![CDATA[PAZ ROA]]></surname>
<given-names><![CDATA[Juan Camilo]]></given-names>
</name>
<name>
<surname><![CDATA[GATICA]]></surname>
<given-names><![CDATA[Gustavo]]></given-names>
</name>
<name>
<surname><![CDATA[LINFATI]]></surname>
<given-names><![CDATA[Rodrigo]]></given-names>
</name>
</person-group>
<source><![CDATA[A probabilistic Granular Tabu Search for the Distance Constrained Capacitated Vehicle Routing Problem (DCVRP). Technical Report]]></source>
<year>2016</year>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Vehicle routing problem with time windows, Part II: Metaheuristics]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[BRÀYSY]]></surname>
<given-names><![CDATA[Olli]]></given-names>
</name>
<name>
<surname><![CDATA[GENDREAU]]></surname>
<given-names><![CDATA[Michel]]></given-names>
</name>
</person-group>
<source><![CDATA[Transportation Science]]></source>
<year>2005</year>
<volume>39</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>119-39</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A multi-objective Pareto Ant Colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[CHÁVEZ]]></surname>
<given-names><![CDATA[Jhon Jairo]]></given-names>
</name>
<name>
<surname><![CDATA[ESCOBAR]]></surname>
<given-names><![CDATA[John Willmer]]></given-names>
</name>
<name>
<surname><![CDATA[GRANADA ECHEVERRI]]></surname>
<given-names><![CDATA[Mauricio]]></given-names>
</name>
</person-group>
<source><![CDATA[International Journal of Industrial Engineering Computations]]></source>
<year>2016</year>
<volume>7</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>35 - 48</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A new optimization algorithm for the vehicle routing problem with time windows]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[DESROCHERS]]></surname>
<given-names><![CDATA[Martin]]></given-names>
</name>
<name>
<surname><![CDATA[DESROSIERS]]></surname>
<given-names><![CDATA[Jacques]]></given-names>
</name>
<name>
<surname><![CDATA[SOLOMON]]></surname>
<given-names><![CDATA[Marius]]></given-names>
</name>
</person-group>
<source><![CDATA[Operations Research]]></source>
<year>1992</year>
<volume>40</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>342-54</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Un algoritmo meta-heurístico basado en recocido simulado con espacio de búsqueda granular para el problema de localización y ruteo con restricciones de capacidad]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[ESCOBAR]]></surname>
<given-names><![CDATA[John Willmer]]></given-names>
</name>
<name>
<surname><![CDATA[RODRIGO]]></surname>
<given-names><![CDATA[Linfati]]></given-names>
</name>
</person-group>
<source><![CDATA[Revista Ingenierías]]></source>
<year>2012</year>
<volume>11</volume>
<numero>21</numero>
<issue>21</issue>
<page-range>139-50</page-range><publisher-name><![CDATA[Universidad de Medellín]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A hybrid metaheuristic algorithm for the capacitated location routing problem]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[ESCOBAR]]></surname>
<given-names><![CDATA[John Willmer]]></given-names>
</name>
<name>
<surname><![CDATA[LINFATI]]></surname>
<given-names><![CDATA[Rodrigo]]></given-names>
</name>
<name>
<surname><![CDATA[ADARME-JAIMES]]></surname>
<given-names><![CDATA[Wilson]]></given-names>
</name>
</person-group>
<source><![CDATA[Dyna]]></source>
<year>2015</year>
<volume>82</volume>
<numero>89</numero>
<issue>89</issue>
<page-range>243-51</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[The vehicle routing problem: latest advances and new challenges]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[GOLDEN]]></surname>
<given-names><![CDATA[Bruce L]]></given-names>
</name>
<name>
<surname><![CDATA[RAGHAVAN]]></surname>
<given-names><![CDATA[Subramanian,]]></given-names>
</name>
<name>
<surname><![CDATA[WASIL]]></surname>
<given-names><![CDATA[EDWARD A]]></given-names>
</name>
</person-group>
<source><![CDATA[Springer Science &amp; Business Media]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Local search with annealing-like restarts to solve the VRPTW]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[LI]]></surname>
<given-names><![CDATA[Haibing]]></given-names>
</name>
<name>
<surname><![CDATA[ANDREW]]></surname>
<given-names><![CDATA[Lim]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational research]]></source>
<year>2003</year>
<volume>150</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>115-27</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Un algoritmo metaheurístico para el problema de localización y ruteo con flota heterogénea]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[LINFATI]]></surname>
<given-names><![CDATA[Rodrigo]]></given-names>
</name>
<name>
<surname><![CDATA[ESCOBAR]]></surname>
<given-names><![CDATA[John Willmer]]></given-names>
</name>
<name>
<surname><![CDATA[GATICA]]></surname>
<given-names><![CDATA[Gustavo]]></given-names>
</name>
</person-group>
<source><![CDATA[Ingeniería y Ciencia]]></source>
<year>2014</year>
<volume>10</volume>
<numero>19</numero>
<issue>19</issue>
<page-range>55-76</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[NOGUERA BOTERO]]></surname>
<given-names><![CDATA[Daniella]]></given-names>
</name>
<name>
<surname><![CDATA[MATEUS]]></surname>
<given-names><![CDATA[Francisco Javier]]></given-names>
</name>
</person-group>
<source><![CDATA[Mejoramiento de la programación de servicios y planificación de rutas en una empresa de servicios de control integral de plagas]]></source>
<year>2014</year>
<publisher-loc><![CDATA[Cali ]]></publisher-loc>
<publisher-name><![CDATA[Pontificia Universidad Javeriana Cali]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SOSA]]></surname>
<given-names><![CDATA[Pablo Andres Rey]]></given-names>
</name>
</person-group>
<source><![CDATA[Ruteo de vehículos con ventanas de tiempo para una cadena de supermercados regional en Chile]]></source>
<year>2005</year>
<publisher-loc><![CDATA[Chile ]]></publisher-loc>
<publisher-name><![CDATA[Universidad de Chile]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[TOTH]]></surname>
<given-names><![CDATA[Paolo]]></given-names>
</name>
</person-group>
<source><![CDATA[Vehicle routing: problems, methods, and applications]]></source>
<year>2014</year>
<volume>18</volume>
<publisher-name><![CDATA[Siam]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
