<?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-38032018000200288</article-id>
<article-id pub-id-type="doi">10.18041/1900-3803/entramado.2.4761</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Propuesta de un modelo de ruteo de vehículos abierto en una institución prestadora de servicios de salud]]></article-title>
<article-title xml:lang="en"><![CDATA[Proposal for an open vehicle routing model in a health-care institution]]></article-title>
<article-title xml:lang="pt"><![CDATA[Proposta de um modelo de roteamento aberto de veículos em uma instituição prestadora de serviços de saúde]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Campo-Zuñiga]]></surname>
<given-names><![CDATA[Byron]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mendoza-Mendoza]]></surname>
<given-names><![CDATA[Adel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad del Atlántico  ]]></institution>
<addr-line><![CDATA[Puerto Colombia Atlántico]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad del Atlántico  ]]></institution>
<addr-line><![CDATA[Puerto Colombia Atlantico]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2018</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2018</year>
</pub-date>
<volume>14</volume>
<numero>2</numero>
<fpage>288</fpage>
<lpage>298</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S1900-38032018000200288&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-38032018000200288&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-38032018000200288&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN En este artículo de investigación se presenta un modelo de optimización basado en la aplicación de dos heurísticas para una situación real de enrutamiento de una flota de vehículos de una Institución Prestadora de Servicios de Salud (IPS) para transportar sus pacientes. Se realizó un estudio cuantitativo mediante la aplicación de las heurísticas del vecino más cercano y la del vecino más cercano modificada ya que este tipo de enrutamiento es del tipo COVRP por sus siglas en inglés: capacited opened vehicle routing problem. Se presenta la tabla de desglose de los costos, el algoritmo de construcción de la matriz de distancias y los algoritmos para las heurísticas. Los resultados indican que la heurística del vecino más cercano ofrece una solución con un costo menor que la del vecino más cercano modificada ya que los ahorros serían del 7,34% y 6,05% respecto al costo actual.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT This research article presents an optimization model based on the application of two heuristics for a real situation of routing a fleet of vehicles of an Institution Provider of Health Services (IPS) to transport their patients. A quantitative study was carried out by applying the heuristics of the nearest neighbor and that of the modified nearest neighbor as this type of routing is of the COVRP type, for its initials in English: capacitated open vehicle routing problem. The cost table, the distance matrix construction algorithm and the heuristic algorithms are presented. The results indicate that the nearest neighbor heuristic offers a solution with a lower cost than that of the modified nearest neighbor since the savings would be 7.34% and 6.05% with respect to the current cost.]]></p></abstract>
<abstract abstract-type="short" xml:lang="pt"><p><![CDATA[RESUMO Este artigo de pesquisa apresenta um modelo de otimização baseado na aplicação de duas heurísticas para uma real situação de roteamento de uma frota de veículos de uma Instituição de Prestadores de Serviços de Saúde (IPS) para o transporte de seus pacientes. Um estudo quantitativo foi realizado aplicando as heurísticas do vizinho mais próximo e do vizinho vizinho modificado, uma vez que esse tipo de roteamento é do tipo COVRP por sua sigla em inglês: capacited open vehicle routing problem. A tabela de decomposição de custos, o algoritmo para a construção da matriz de distância e os algoritmos para as heurísticas são apresentados. Os resultados indicam que a heurística do vizinho mais próximo oferece uma solução com custo menor que o vizinho mais próximo modificado, uma vez que a economia seria de 7,34% e 6,05% em relação ao custo atual.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Heurística]]></kwd>
<kwd lng="es"><![CDATA[enrutamiento de vehículos]]></kwd>
<kwd lng="es"><![CDATA[algoritmo]]></kwd>
<kwd lng="es"><![CDATA[COVRP]]></kwd>
<kwd lng="en"><![CDATA[Heuristics]]></kwd>
<kwd lng="en"><![CDATA[vehicle routing]]></kwd>
<kwd lng="en"><![CDATA[algorithm]]></kwd>
<kwd lng="en"><![CDATA[COVRP]]></kwd>
<kwd lng="pt"><![CDATA[Heurística]]></kwd>
<kwd lng="pt"><![CDATA[roteamento de veículos]]></kwd>
<kwd lng="pt"><![CDATA[algoritmo]]></kwd>
<kwd lng="pt"><![CDATA[COVRP]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[AKSEN]]></surname>
<given-names><![CDATA[Deniz]]></given-names>
</name>
<name>
<surname><![CDATA[ÖZYURT]]></surname>
<given-names><![CDATA[Zeynet]]></given-names>
</name>
<name>
<surname><![CDATA[ARAS]]></surname>
<given-names><![CDATA[Necati]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Open vehicle routing problem with driver nodes and time deadlines]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2007</year>
<volume>58</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>1223-34</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[ASHOURI]]></surname>
<given-names><![CDATA[Maryam]]></given-names>
</name>
<name>
<surname><![CDATA[YOUSEFIKHOSHBAKHT]]></surname>
<given-names><![CDATA[Majid]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A combination of meta-heuristic and heuristic algorithms for the VRP, OVRP and VRP with simultaneous pickup and delivery]]></article-title>
<source><![CDATA[BRAIN. Broad Research in Artificial Intelligence and Neuroscience]]></source>
<year>2017</year>
<volume>8</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>81-95</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[ATEFI]]></surname>
<given-names><![CDATA[Reza]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The open vehicle routing problem with decoupling points]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[SALARI]]></surname>
<given-names><![CDATA[Majid]]></given-names>
</name>
<name>
<surname><![CDATA[COELHO]]></surname>
<given-names><![CDATA[Leandro]]></given-names>
</name>
<name>
<surname><![CDATA[RENAUD]]></surname>
<given-names><![CDATA[Jacques]]></given-names>
</name>
</person-group>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2018</year>
<volume>265</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>316-27</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BAUER]]></surname>
<given-names><![CDATA[Joanna]]></given-names>
</name>
<name>
<surname><![CDATA[LYSGAARD]]></surname>
<given-names><![CDATA[Jens]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The offshore wind farm array cable layout problem: a planar open vehicle routing problem]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2015</year>
<volume>66</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>360-8</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BEKTAS]]></surname>
<given-names><![CDATA[Tolga]]></given-names>
</name>
<name>
<surname><![CDATA[ELMASTAS]]></surname>
<given-names><![CDATA[Seda]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving school bus routing problems through integer programming]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2007</year>
<volume>58</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>1599-604</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[BEN ATKINSON]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A vehicle-scheduling system for delivering school meals]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>1990</year>
<volume>41</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>703-11</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[CAO]]></surname>
<given-names><![CDATA[Erbao]]></given-names>
</name>
<name>
<surname><![CDATA[LAI]]></surname>
<given-names><![CDATA[Mingyong]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The open vehicle routing problem with fuzzy demands]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2010</year>
<volume>37</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>2405-11</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[CAO]]></surname>
<given-names><![CDATA[Erbao]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Open vehicle routing problem with demand uncertainty and its robust strategies]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[LAI]]></surname>
<given-names><![CDATA[Mingyong]]></given-names>
</name>
<name>
<surname><![CDATA[YANG]]></surname>
<given-names><![CDATA[Hongming]]></given-names>
</name>
</person-group>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2014</year>
<volume>41</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>3569-75</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[CHEN]]></surname>
<given-names><![CDATA[Ping]]></given-names>
</name>
<name>
<surname><![CDATA[DONG]]></surname>
<given-names><![CDATA[Xingye]]></given-names>
</name>
<name>
<surname><![CDATA[XIAO]]></surname>
<given-names><![CDATA[Jianhua]]></given-names>
</name>
</person-group>
<source><![CDATA[Study on split delivery open vehicle routing problem within two splits]]></source>
<year>2016</year>
<conf-name><![CDATA[ Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD), 2016 12th International Conference on, IEEE]]></conf-name>
<conf-loc> </conf-loc>
<page-range>724-8</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[CLARKE]]></surname>
<given-names><![CDATA[Geoff]]></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>
<numero>4</numero>
<issue>4</issue>
<page-range>568-81</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[DANTZIG]]></surname>
<given-names><![CDATA[George]]></given-names>
</name>
<name>
<surname><![CDATA[FULKERSON]]></surname>
<given-names><![CDATA[Delbert]]></given-names>
</name>
<name>
<surname><![CDATA[JOHNSON]]></surname>
<given-names><![CDATA[Selmer]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solution of a large-scale traveling salesman problem]]></article-title>
<source><![CDATA[Journal of the operations research society of America]]></source>
<year>1954</year>
<volume>2</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>393-410</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[DANTZIG]]></surname>
<given-names><![CDATA[George]]></given-names>
</name>
<name>
<surname><![CDATA[RAMSER]]></surname>
<given-names><![CDATA[John]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The truck-dispatching problem]]></article-title>
<source><![CDATA[Management Science]]></source>
<year>1959</year>
<volume>6</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>80-91</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[DERIGS]]></surname>
<given-names><![CDATA[Ulrich]]></given-names>
</name>
<name>
<surname><![CDATA[REUTER]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A simple and efficient tabu search heuristic for solving the open vehicle routing problem]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2009</year>
<volume>60</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>1658-69</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[EPPEN]]></surname>
<given-names><![CDATA[Gary D]]></given-names>
</name>
</person-group>
<source><![CDATA[Investigación de operaciones en la ciencia administrativa: construcción de modelos para la toma de decisiones con hojas de cálculo electrónicas]]></source>
<year>2000</year>
<publisher-name><![CDATA[Pearson Educación]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[FENGHUA]]></surname>
<given-names><![CDATA[Duan]]></given-names>
</name>
<name>
<surname><![CDATA[XIAONIAN]]></surname>
<given-names><![CDATA[He]]></given-names>
</name>
</person-group>
<source><![CDATA[On open vehicle routing problem with soft time windows and tabu search]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[FU]]></surname>
<given-names><![CDATA[Zhuo]]></given-names>
</name>
<name>
<surname><![CDATA[WRIGHT]]></surname>
<given-names><![CDATA[Mike]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Train plan model for British rail freight services through the channel tunnel]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>1994</year>
<volume>45</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>384-91</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[FU]]></surname>
<given-names><![CDATA[Zhuo]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The capacitated open vehicle routing problem and its tabu search algorithm]]></article-title>
<source><![CDATA[Systems Engineering-theory &amp; Practice]]></source>
<year>2004</year>
<volume>3</volume>
<page-range>123-8</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[GE]]></surname>
<given-names><![CDATA[Bin]]></given-names>
</name>
<name>
<surname><![CDATA[HAN]]></surname>
<given-names><![CDATA[Yue]]></given-names>
</name>
<name>
<surname><![CDATA[BIAN]]></surname>
<given-names><![CDATA[Chen]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hybrid ant colony optimization algorithm for solving the open vehicle routing problem]]></article-title>
<source><![CDATA[Journal of Computers]]></source>
<year>2016</year>
<volume>27</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>41-54</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[GE]]></surname>
<given-names><![CDATA[Hongyi]]></given-names>
</name>
<name>
<surname><![CDATA[ZHEN]]></surname>
<given-names><![CDATA[Tong]]></given-names>
</name>
<name>
<surname><![CDATA[JIANG]]></surname>
<given-names><![CDATA[Yuying]]></given-names>
</name>
<name>
<surname><![CDATA[CHE]]></surname>
<given-names><![CDATA[Yi]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An intelligent solution for open vehicle routing problem in grain logistics]]></article-title>
<source><![CDATA[Advances in Wireless Networks and Information Systems]]></source>
<year>2010</year>
<volume>72</volume>
<page-range>389-96</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[GUO]]></surname>
<given-names><![CDATA[Jinling]]></given-names>
</name>
<name>
<surname><![CDATA[YU]]></surname>
<given-names><![CDATA[Shiwey]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid algorithm for open vehicle routing optimization of coal mines material]]></article-title>
<source><![CDATA[Applied Mechanics and Mate rials]]></source>
<year>2012</year>
<volume>197</volume>
<page-range>455-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[GURPREETSINGH]]></surname>
<given-names><![CDATA[Er]]></given-names>
</name>
<name>
<surname><![CDATA[DHIR]]></surname>
<given-names><![CDATA[Vijay]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Open vehicle routing problem by ant colony optimization]]></article-title>
<source><![CDATA[International Journal of Advanced Computer Science and Applications]]></source>
<year>2014</year>
<volume>5</volume>
<page-range>63-8</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[HEDAR]]></surname>
<given-names><![CDATA[Abdel]]></given-names>
</name>
<name>
<surname><![CDATA[ABDALLAH]]></surname>
<given-names><![CDATA[Mohammed]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Applying tabu search in finding an efficient solution for the OVRP]]></article-title>
<source><![CDATA[International Journal of Open Problems in Computer Science and Mathematics (IJOPCM)]]></source>
<year>2014</year>
<volume>7</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>36-51</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[HOSSEINABADI]]></surname>
<given-names><![CDATA[Ali]]></given-names>
</name>
<name>
<surname><![CDATA[KARDGAR]]></surname>
<given-names><![CDATA[Maryam]]></given-names>
</name>
<name>
<surname><![CDATA[SHOJAFAR]]></surname>
<given-names><![CDATA[Mohammad]]></given-names>
</name>
<name>
<surname><![CDATA[SHAMSHIRBAND]]></surname>
<given-names><![CDATA[Shahab]]></given-names>
</name>
<name>
<surname><![CDATA[ABRAHAM]]></surname>
<given-names><![CDATA[Ajith]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Gravitational search algorithm to solve open vehicle routing problem]]></article-title>
<source><![CDATA[Innovations in Bio-Inspired Computing and Applications]]></source>
<year>2016</year>
<page-range>93-103</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[HOSSEINABADI]]></surname>
<given-names><![CDATA[Ali]]></given-names>
</name>
<name>
<surname><![CDATA[VAHIDI]]></surname>
<given-names><![CDATA[Javad]]></given-names>
</name>
<name>
<surname><![CDATA[BALAS]]></surname>
<given-names><![CDATA[Valentina]]></given-names>
</name>
<name>
<surname><![CDATA[MIRKAMALI]]></surname>
<given-names><![CDATA[Seyed]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[OVRP_GELS: solving open vehicle routing problem using the gravitational emulation local search algorithm]]></article-title>
<source><![CDATA[Neural Computing and Applications]]></source>
<year>2016</year>
<page-range>1-14</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[HU]]></surname>
<given-names><![CDATA[Fengjun]]></given-names>
</name>
<name>
<surname><![CDATA[WU]]></surname>
<given-names><![CDATA[Fan]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Diploid hybrid particle swarm optimization with differential evolution for open vehicle routing problem]]></article-title>
<source><![CDATA[Intelligent Control and Automation]]></source>
<year>2010</year>
<page-range>2692-7</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[JINHUI]]></surname>
<given-names><![CDATA[Ge]]></given-names>
</name>
<name>
<surname><![CDATA[YING]]></surname>
<given-names><![CDATA[Xiong]]></given-names>
</name>
<name>
<surname><![CDATA[HONGZHEN]]></surname>
<given-names><![CDATA[Wang]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved TS for the open vehicle routing problem with soft time windows]]></article-title>
<source><![CDATA[Computational Intelligence and Design]]></source>
<year>2012</year>
<page-range>382-5</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[KRITZINGER]]></surname>
<given-names><![CDATA[Stefanie]]></given-names>
</name>
<name>
<surname><![CDATA[DOERNER]]></surname>
<given-names><![CDATA[Karl]]></given-names>
</name>
<name>
<surname><![CDATA[TRICOIRE]]></surname>
<given-names><![CDATA[Fabien]]></given-names>
</name>
<name>
<surname><![CDATA[HARTL]]></surname>
<given-names><![CDATA[Richard]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Adaptive search techniques for problems in vehicle routing, Part II: A numerical comparison]]></article-title>
<source><![CDATA[Yugoslav Journal of Operations Research]]></source>
<year>2016</year>
<volume>25</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>3-31</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LABADIE]]></surname>
<given-names><![CDATA[Nacima]]></given-names>
</name>
<name>
<surname><![CDATA[PRINS]]></surname>
<given-names><![CDATA[Christian]]></given-names>
</name>
<name>
<surname><![CDATA[PRODHON]]></surname>
<given-names><![CDATA[Caroline]]></given-names>
</name>
</person-group>
<source><![CDATA[Metaheuristics for Vehicle Routing Problems]]></source>
<year>2016</year>
<publisher-name><![CDATA[John Wiley &amp; Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B29">
<label>29</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LALLA-RUIZ]]></surname>
<given-names><![CDATA[Eduardo]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved formulation for the multi-depot open vehicle routing problem]]></article-title>
<source><![CDATA[OR spectrum]]></source>
<year>2016</year>
<volume>38</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>175-87</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LALLA-RUIZ]]></surname>
<given-names><![CDATA[Eduardo]]></given-names>
</name>
<name>
<surname><![CDATA[VOß]]></surname>
<given-names><![CDATA[Stefan]]></given-names>
</name>
</person-group>
<source><![CDATA[A note on a hybrid genetic algorithm for the multi-depot open vehicle routing problem]]></source>
<year>2016</year>
</nlm-citation>
</ref>
<ref id="B31">
<label>31</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LETCHFORD]]></surname>
<given-names><![CDATA[Adam]]></given-names>
</name>
<name>
<surname><![CDATA[LYSGAARD]]></surname>
<given-names><![CDATA[Jens]]></given-names>
</name>
<name>
<surname><![CDATA[EGLESE]]></surname>
<given-names><![CDATA[Richard]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A branchand- cut algorithm for the capacitated open vehicle routing problem]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2007</year>
<volume>58</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>1642-51</page-range></nlm-citation>
</ref>
<ref id="B32">
<label>32</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LI]]></surname>
<given-names><![CDATA[Leon]]></given-names>
</name>
<name>
<surname><![CDATA[FU]]></surname>
<given-names><![CDATA[Zhuo]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The school bus routing problem: a case study]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2002</year>
<volume>53</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>552-8</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>33</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LI]]></surname>
<given-names><![CDATA[Feiyue]]></given-names>
</name>
<name>
<surname><![CDATA[GOLDEN]]></surname>
<given-names><![CDATA[Bruce]]></given-names>
</name>
<name>
<surname><![CDATA[WASIL]]></surname>
<given-names><![CDATA[Edward]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The open vehicle routing problem: Algorithms, large-scale test problems, and computational results]]></article-title>
<source><![CDATA[Computers &amp; operations research]]></source>
<year>2007</year>
<volume>34</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>2918-30</page-range></nlm-citation>
</ref>
<ref id="B34">
<label>34</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LI]]></surname>
<given-names><![CDATA[Xiang]]></given-names>
</name>
<name>
<surname><![CDATA[LEUNG]]></surname>
<given-names><![CDATA[Stephen]]></given-names>
</name>
<name>
<surname><![CDATA[TIAN]]></surname>
<given-names><![CDATA[Peng]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multistart adaptive memory- based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2012</year>
<volume>39</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>365-74</page-range></nlm-citation>
</ref>
<ref id="B35">
<label>35</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LIU]]></surname>
<given-names><![CDATA[Ran]]></given-names>
</name>
<name>
<surname><![CDATA[JIANG]]></surname>
<given-names><![CDATA[Zhibin]]></given-names>
</name>
<name>
<surname><![CDATA[GENG]]></surname>
<given-names><![CDATA[Na]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Erratum to: A hybrid genetic algorithm for the multi-depot open vehicle routing problem]]></article-title>
<source><![CDATA[OR Spectrum]]></source>
<year>2014</year>
<volume>36</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>423-4</page-range></nlm-citation>
</ref>
<ref id="B36">
<label>36</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LIU]]></surname>
<given-names><![CDATA[Ran]]></given-names>
</name>
<name>
<surname><![CDATA[JIANG]]></surname>
<given-names><![CDATA[Zhibin]]></given-names>
</name>
<name>
<surname><![CDATA[GENG]]></surname>
<given-names><![CDATA[Na]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid genetic algorithm for the multi-depot open vehicle routing problem]]></article-title>
<source><![CDATA[OR spectrum]]></source>
<year>2014</year>
<volume>36</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>401-21</page-range></nlm-citation>
</ref>
<ref id="B37">
<label>37</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LÓPEZ-SÁNCHEZ]]></surname>
<given-names><![CDATA[Ana]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multi-start algorithm for a balanced real-world open vehicle routing problem]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2014</year>
<volume>238</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>104-13</page-range></nlm-citation>
</ref>
<ref id="B38">
<label>38</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[MARINAKIS]]></surname>
<given-names><![CDATA[Yannis]]></given-names>
</name>
<name>
<surname><![CDATA[MARINAKI]]></surname>
<given-names><![CDATA[Magdalene]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Bumble bees mating optimization algorithm for the vehicle routing problem]]></article-title>
<source><![CDATA[Handbook of Swarm Intelligence]]></source>
<year>2011</year>
<page-range>347-69</page-range></nlm-citation>
</ref>
<ref id="B39">
<label>39</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[MARINAKIS]]></surname>
<given-names><![CDATA[Yannis]]></given-names>
</name>
<name>
<surname><![CDATA[MARINAKI]]></surname>
<given-names><![CDATA[Magdalene]]></given-names>
</name>
</person-group>
<source><![CDATA[A honey bees mating optimization algorithm for the open vehicle routing problem]]></source>
<year>2011</year>
<conf-name><![CDATA[ Proceedings of the 13th annual conference on Genetic and evolutionary computation]]></conf-name>
<conf-loc> </conf-loc>
<page-range>101-8</page-range></nlm-citation>
</ref>
<ref id="B40">
<label>40</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[MIRHASSANI]]></surname>
<given-names><![CDATA[S.A]]></given-names>
</name>
<name>
<surname><![CDATA[ABOLGHASEMI]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A particle swarm optimization algorithm for open vehicle routing problem]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2011</year>
<volume>38</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>11547-51</page-range></nlm-citation>
</ref>
<ref id="B41">
<label>41</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[NADERIPOUR]]></surname>
<given-names><![CDATA[Mansoureh]]></given-names>
</name>
<name>
<surname><![CDATA[ALINAGHIAN]]></surname>
<given-names><![CDATA[Mahdi]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Measurement, evaluation and minimization of CO2, NOx, and CO emissions in the open time dependent vehicle routing problem]]></article-title>
<source><![CDATA[Measurement]]></source>
<year>2016</year>
<volume>90</volume>
<page-range>443-52</page-range></nlm-citation>
</ref>
<ref id="B42">
<label>42</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[NOROUZI]]></surname>
<given-names><![CDATA[Narges]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization]]></article-title>
<source><![CDATA[Networks and Spatial Economics]]></source>
<year>2012</year>
<volume>12</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>609-33</page-range></nlm-citation>
</ref>
<ref id="B43">
<label>43</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[ÖZYURT]]></surname>
<given-names><![CDATA[Zeynep]]></given-names>
</name>
<name>
<surname><![CDATA[AKSEN]]></surname>
<given-names><![CDATA[Deniz]]></given-names>
</name>
<name>
<surname><![CDATA[ARAS]]></surname>
<given-names><![CDATA[Necati]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Open vehicle routing problem with time deadlines: Solution methods and an application]]></article-title>
<source><![CDATA[Operations Research Proceedings]]></source>
<year>2005</year>
<volume>2006</volume>
<page-range>73-8</page-range></nlm-citation>
</ref>
<ref id="B44">
<label>44</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[PAN]]></surname>
<given-names><![CDATA[Lijum]]></given-names>
</name>
<name>
<surname><![CDATA[FU]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A clone selection algorithm for the open vehicle routing problem]]></article-title>
<source><![CDATA[Genetic and Evolutionary Computing]]></source>
<year>2009</year>
<page-range>786-90</page-range></nlm-citation>
</ref>
<ref id="B45">
<label>45</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[PENNA]]></surname>
<given-names><![CDATA[Puca]]></given-names>
</name>
<name>
<surname><![CDATA[SUBRAMANIAN]]></surname>
<given-names><![CDATA[Anand]]></given-names>
</name>
<name>
<surname><![CDATA[OCHI]]></surname>
<given-names><![CDATA[Luiz]]></given-names>
</name>
</person-group>
<source><![CDATA[An iterated local search heuristic for open vehicle routing problems]]></source>
<year>2012</year>
<conf-name><![CDATA[ Congreso Latino-Iberoamericano de Investigacion operativa y Simposio Brasileiro de Pesquisa Operacional]]></conf-name>
<conf-loc> </conf-loc>
<page-range>4504-14</page-range></nlm-citation>
</ref>
<ref id="B46">
<label>46</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[PESSOA]]></surname>
<given-names><![CDATA[Artur]]></given-names>
</name>
<name>
<surname><![CDATA[DE ARAGÃO]]></surname>
<given-names><![CDATA[Marcus]]></given-names>
</name>
<name>
<surname><![CDATA[UCHOA]]></surname>
<given-names><![CDATA[Eduardo]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Robust branch-cut-and-price algorithms for vehicle routing problems]]></article-title>
<source><![CDATA[The vehicle routing problem: Latest advances and new challenges]]></source>
<year>2008</year>
<volume>43</volume>
<page-range>297-325</page-range></nlm-citation>
</ref>
<ref id="B47">
<label>47</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[PICHPIBUL]]></surname>
<given-names><![CDATA[Tantikorn]]></given-names>
</name>
<name>
<surname><![CDATA[KAWTUMMACHAI]]></surname>
<given-names><![CDATA[Ruengsak]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A heuristic approach based on clarke-wright algorithm for open vehicle routing problem]]></article-title>
<source><![CDATA[The Scientific World Journal]]></source>
<year>2013</year>
</nlm-citation>
</ref>
<ref id="B48">
<label>48</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[PISINGER]]></surname>
<given-names><![CDATA[David]]></given-names>
</name>
<name>
<surname><![CDATA[ROPKE]]></surname>
<given-names><![CDATA[Stefan]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A general heuristic for vehicle routing problems]]></article-title>
<source><![CDATA[Computers &amp; operations research]]></source>
<year>2007</year>
<volume>34</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>2403-35</page-range></nlm-citation>
</ref>
<ref id="B49">
<label>49</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[RAFF]]></surname>
<given-names><![CDATA[Samuel]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Routing and scheduling of vehicles and crews: The state of the art]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>1983</year>
<volume>10</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B50">
<label>50</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[REDI]]></surname>
<given-names><![CDATA[A.P.]]></given-names>
</name>
<name>
<surname><![CDATA[MAGHFIROH]]></surname>
<given-names><![CDATA[Meilinda]]></given-names>
</name>
<name>
<surname><![CDATA[VINCENT]]></surname>
<given-names><![CDATA[Yu]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved variable neighborhood search for the open vehicle routing problem with time windows]]></article-title>
<source><![CDATA[Industrial Engineering and Engineering Management (IEEM)]]></source>
<year>2013</year>
<page-range>1641-5</page-range></nlm-citation>
</ref>
<ref id="B51">
<label>51</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[REINHOLZ]]></surname>
<given-names><![CDATA[Andreas]]></given-names>
</name>
<name>
<surname><![CDATA[SCHNEIDER]]></surname>
<given-names><![CDATA[Holger]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid (1+1)-evolutionary strategy for the open vehicle routing problem]]></article-title>
<source><![CDATA[Advances in Metaheuristics]]></source>
<year>2013</year>
<page-range>127-41</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B52">
<label>52</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[REN]]></surname>
<given-names><![CDATA[Chunyu]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Research on single and mixed fleet strategy for open vehicle routing problem]]></article-title>
<source><![CDATA[Journal of Software]]></source>
<year>2011</year>
<volume>6</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>2076-81</page-range></nlm-citation>
</ref>
<ref id="B53">
<label>53</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[REPOUSSIS]]></surname>
<given-names><![CDATA[Panagiotis]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A web-based decision support system for waste lube oils collection and recycling]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2009</year>
<month>b</month>
<volume>195</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>676-700</page-range></nlm-citation>
</ref>
<ref id="B54">
<label>54</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[REPOUSSIS]]></surname>
<given-names><![CDATA[Panagiotis]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid evolution strategy for the open vehicle routing problem.]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2010</year>
<volume>37</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>443-55</page-range></nlm-citation>
</ref>
<ref id="B55">
<label>55</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[REPOUSSIS]]></surname>
<given-names><![CDATA[Panagiotis]]></given-names>
</name>
<name>
<surname><![CDATA[TARANTILIS]]></surname>
<given-names><![CDATA[Christos]]></given-names>
</name>
<name>
<surname><![CDATA[IOANNOU]]></surname>
<given-names><![CDATA[George]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The open vehicle routing problem with time windows]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2007</year>
<volume>58</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>355-67</page-range></nlm-citation>
</ref>
<ref id="B56">
<label>56</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[RUIZ]]></surname>
<given-names><![CDATA[Hector]]></given-names>
</name>
<name>
<surname><![CDATA[RUIZ]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[ALCARAZ]]></surname>
<given-names><![CDATA[M.V. Manuel]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Problemas de rutas abiertas de vehículos con restricciones de capacidad heterogéneas]]></article-title>
<source><![CDATA[Revista de Difusión Técnico Científica de Instituto Tecnológico de Nogales]]></source>
<year>2016</year>
<page-range>5-7</page-range></nlm-citation>
</ref>
<ref id="B57">
<label>57</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[RUSSELL]]></surname>
<given-names><![CDATA[Robert]]></given-names>
</name>
<name>
<surname><![CDATA[CHIANG]]></surname>
<given-names><![CDATA[Wenchyuan]]></given-names>
</name>
<name>
<surname><![CDATA[ZEPEDA]]></surname>
<given-names><![CDATA[David]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Integrating multi-product production and distribution in newspaper logistics]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2008</year>
<volume>35</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1576-88</page-range></nlm-citation>
</ref>
<ref id="B58">
<label>58</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[RUSSELL]]></surname>
<given-names><![CDATA[Robert]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A constraint programming approach to designing a newspaper distribution system]]></article-title>
<source><![CDATA[International Journal of Production Economics]]></source>
<year>2013</year>
<volume>145</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>132-8</page-range></nlm-citation>
</ref>
<ref id="B59">
<label>59</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SALARI]]></surname>
<given-names><![CDATA[Mahid]]></given-names>
</name>
<name>
<surname><![CDATA[TOTH]]></surname>
<given-names><![CDATA[Paolo]]></given-names>
</name>
<name>
<surname><![CDATA[TRAMONTANI]]></surname>
<given-names><![CDATA[Andrea]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An ILP improvement procedure for the open vehicle routing problem]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2010</year>
<volume>37</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>2106-20</page-range></nlm-citation>
</ref>
<ref id="B60">
<label>60</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SARIKLIS]]></surname>
<given-names><![CDATA[Dimitrios]]></given-names>
</name>
<name>
<surname><![CDATA[POWELL]]></surname>
<given-names><![CDATA[Susan]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A heuristic method for the open vehicle routing problem]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2000</year>
<volume>51</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>564-73</page-range></nlm-citation>
</ref>
<ref id="B61">
<label>61</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SCÁRDUA]]></surname>
<given-names><![CDATA[Rayane]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Planejamento do transporte de empregados por uma frota de ônibus fretada por meio de um modelo matemático baseado no open vehicle routing problem (OVRP)]]></article-title>
<source><![CDATA[TRANSPORTES]]></source>
<year>2016</year>
<volume>24</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>20-8</page-range></nlm-citation>
</ref>
<ref id="B62">
<label>62</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SCHOPKA]]></surname>
<given-names><![CDATA[Kristian]]></given-names>
</name>
<name>
<surname><![CDATA[KOPFER]]></surname>
<given-names><![CDATA[Herbert]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An adaptive large neighborhood search for the reverse open vehicle routing problem with time windows]]></article-title>
<source><![CDATA[Logistics Management]]></source>
<year>2016</year>
<page-range>243-57</page-range></nlm-citation>
</ref>
<ref id="B63">
<label>63</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SCHRAGE]]></surname>
<given-names><![CDATA[Linus]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Formulation and structure of more complex/realistic routing and scheduling problems]]></article-title>
<source><![CDATA[Networks]]></source>
<year>1981</year>
<volume>11</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>229-32</page-range></nlm-citation>
</ref>
<ref id="B64">
<label>64</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SEDIGHPOUR]]></surname>
<given-names><![CDATA[Mohammad]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving the open vehicle routing problem by a hybrid ant colony optimization]]></article-title>
<source><![CDATA[Kuwait Journal of Science]]></source>
<year>2014</year>
<volume>41</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>139-62</page-range></nlm-citation>
</ref>
<ref id="B65">
<label>65</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SEVKLI]]></surname>
<given-names><![CDATA[Aise]]></given-names>
</name>
<name>
<surname><![CDATA[GÜLER]]></surname>
<given-names><![CDATA[Bekir]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multi-phase oscillated variable neighbourhood search algorithm for a real-world open vehicle routing problem]]></article-title>
<source><![CDATA[Applied Soft Computing]]></source>
<year>2017</year>
<volume>58</volume>
<page-range>128-44</page-range></nlm-citation>
</ref>
<ref id="B66">
<label>66</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SHAMSHIRBAND]]></surname>
<given-names><![CDATA[Shabad]]></given-names>
</name>
</person-group>
<source><![CDATA[OVRP_ICA: An imperialist-based optimization algorithm for the open vehicle routing problem]]></source>
<year>2015</year>
<conf-name><![CDATA[ International Conference on Hybrid Artificial Intelligence Systems, Springer]]></conf-name>
<conf-loc> </conf-loc>
<page-range>221-33</page-range></nlm-citation>
</ref>
<ref id="B67">
<label>67</label><nlm-citation citation-type="">
<collab>SIAMAC</collab>
<source><![CDATA[Universidad Nacional de Colombia Sede Amazonía]]></source>
<year>2010</year>
</nlm-citation>
</ref>
<ref id="B68">
<label>68</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SOTO]]></surname>
<given-names><![CDATA[Maria]]></given-names>
</name>
<name>
<surname><![CDATA[SEVAUX]]></surname>
<given-names><![CDATA[Marc]]></given-names>
</name>
<name>
<surname><![CDATA[ROSSI]]></surname>
<given-names><![CDATA[André]]></given-names>
</name>
<name>
<surname><![CDATA[REINHOLZ]]></surname>
<given-names><![CDATA[Andreas]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2017</year>
<volume>107</volume>
<page-range>211-22</page-range></nlm-citation>
</ref>
<ref id="B69">
<label>69</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SUBRAMANIAN]]></surname>
<given-names><![CDATA[Anand]]></given-names>
</name>
<name>
<surname><![CDATA[UCHOA]]></surname>
<given-names><![CDATA[Eduardo]]></given-names>
</name>
<name>
<surname><![CDATA[OCHI]]></surname>
<given-names><![CDATA[Luiz]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid algorithm for a class of vehicle routing problems]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2013</year>
<volume>40</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>2519-31</page-range></nlm-citation>
</ref>
<ref id="B70">
<label>70</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[SYSLO]]></surname>
<given-names><![CDATA[Marciej M.]]></given-names>
</name>
<name>
<surname><![CDATA[DEO]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[KOWALIK]]></surname>
<given-names><![CDATA[J. S]]></given-names>
</name>
</person-group>
<source><![CDATA[Discrete optimization with pascal programs]]></source>
<year>1983</year>
<publisher-loc><![CDATA[Englewood Cliffs, NJ ]]></publisher-loc>
<publisher-name><![CDATA[Prentice-Hall]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B71">
<label>71</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[TAMBUNAN]]></surname>
<given-names><![CDATA[Hardi]]></given-names>
</name>
<name>
<surname><![CDATA[MAWENGKANG]]></surname>
<given-names><![CDATA[Herman]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mixed Integer Programming Model for open Vehicle Routing Problem with Fleet and driver Scheduling Considering Delivery and Pick-Up Simultaneously]]></article-title>
<source><![CDATA[International Journal on Recent and Innovation Trends in Computing and Communication]]></source>
<year>2015</year>
<volume>3</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>5508-13</page-range></nlm-citation>
</ref>
<ref id="B72">
<label>72</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[TARANTILIS]]></surname>
<given-names><![CDATA[Christos]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>2005</year>
<volume>56</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>588-96</page-range></nlm-citation>
</ref>
<ref id="B73">
<label>73</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[TYASNURITA]]></surname>
<given-names><![CDATA[Raras]]></given-names>
</name>
<name>
<surname><![CDATA[ÖZCAN]]></surname>
<given-names><![CDATA[Ender]]></given-names>
</name>
<name>
<surname><![CDATA[JOHN]]></surname>
<given-names><![CDATA[Robert]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Learning heuristic selection using a time delay neural network for open vehicle routing]]></article-title>
<source><![CDATA[Evolutionary Computation (CEC)]]></source>
<year>2017</year>
<page-range>1474-81</page-range></nlm-citation>
</ref>
<ref id="B74">
<label>74</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[VINCENT]]></surname>
<given-names><![CDATA[F. Yu]]></given-names>
</name>
<name>
<surname><![CDATA[JEWPANYA]]></surname>
<given-names><![CDATA[Parida]]></given-names>
</name>
<name>
<surname><![CDATA[REDI]]></surname>
<given-names><![CDATA[AAN Perwira]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Open vehicle routing problem with cross-docking]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2016</year>
<volume>94</volume>
<page-range>6-17</page-range></nlm-citation>
</ref>
<ref id="B75">
<label>75</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[WANG]]></surname>
<given-names><![CDATA[Shuxia]]></given-names>
</name>
<name>
<surname><![CDATA[XIONG]]></surname>
<given-names><![CDATA[Ying]]></given-names>
</name>
<name>
<surname><![CDATA[WANG]]></surname>
<given-names><![CDATA[Zengqiang]]></given-names>
</name>
</person-group>
<source><![CDATA[A Study on the Taboo Search Algorithm for the Open Vehicle Routing Problem with Hard Time Windows]]></source>
<year>2012</year>
<conf-name><![CDATA[ Proceedings of the 2012 International Conference on Computer Application and System Modeling]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B76">
<label>76</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[WANG]]></surname>
<given-names><![CDATA[Xuping]]></given-names>
</name>
<name>
<surname><![CDATA[ZHAN]]></surname>
<given-names><![CDATA[Hongxin]]></given-names>
</name>
<name>
<surname><![CDATA[ZHANG]]></surname>
<given-names><![CDATA[Jun]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Research of Oil Product Secondary Distribution Optimization Based on Collaborative Distribution]]></article-title>
<source><![CDATA[Procedia Computer Science]]></source>
<year>2015</year>
<volume>60</volume>
<page-range>1367-76</page-range></nlm-citation>
</ref>
<ref id="B77">
<label>77</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[YANG]]></surname>
<given-names><![CDATA[Jiao-ping]]></given-names>
</name>
<name>
<surname><![CDATA[ZHAO]]></surname>
<given-names><![CDATA[Hong-xia]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Research on multi-enterprise allied open vehicle routing problem and its genetic algorithm]]></article-title>
<source><![CDATA[Multimedia Technology (ICMT)]]></source>
<year>2010</year>
<page-range>1-4</page-range></nlm-citation>
</ref>
<ref id="B78">
<label>78</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[YILMAZ]]></surname>
<given-names><![CDATA[Duygu]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Introducing the MCHF/OVRP/SDMP: Multicapacitated/Heterogeneous Fleet/Open Vehicle Routing Problems with Split Deliveries and Multiproducts]]></article-title>
<source><![CDATA[The Scientific World Journal]]></source>
<year>2014</year>
<volume>2014</volume>
</nlm-citation>
</ref>
<ref id="B79">
<label>79</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[YOUSEFIKHOSHBAKHT]]></surname>
<given-names><![CDATA[Majid]]></given-names>
</name>
<name>
<surname><![CDATA[DIDEHVAR]]></surname>
<given-names><![CDATA[Farzad]]></given-names>
</name>
<name>
<surname><![CDATA[RAHMATI]]></surname>
<given-names><![CDATA[Farhad]]></given-names>
</name>
<name>
<surname><![CDATA[SEDIGHPOUR]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An effective imperialist competitive algorithm for solving the open vehicle routing problem]]></article-title>
<source><![CDATA[Journal of Transportation Research]]></source>
<year>2012</year>
<volume>9</volume>
<page-range>83-95</page-range></nlm-citation>
</ref>
<ref id="B80">
<label>80</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[YOUSEFIKHOSHBAKHT]]></surname>
<given-names><![CDATA[Majid]]></given-names>
</name>
<name>
<surname><![CDATA[DIDEHVAR]]></surname>
<given-names><![CDATA[Farzad]]></given-names>
</name>
<name>
<surname><![CDATA[RAHMATI]]></surname>
<given-names><![CDATA[Farhad]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A mixed integer programming formulation for the heterogeneous fixed fleet open vehicle routing problem]]></article-title>
<source><![CDATA[Journal of Optimization in Industrial Engineering]]></source>
<year>2015</year>
<volume>8</volume>
<numero>18</numero>
<issue>18</issue>
<page-range>37-46</page-range></nlm-citation>
</ref>
<ref id="B81">
<label>81</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[YOUSEFIKHOSHBAKHT]]></surname>
<given-names><![CDATA[Majid]]></given-names>
</name>
<name>
<surname><![CDATA[DOLATNEJAD]]></surname>
<given-names><![CDATA[Azam]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A column generation for the heterogeneous fixed fleet open vehicle routing problem]]></article-title>
<source><![CDATA[International Journal of Production Management and Engineering]]></source>
<year>2017</year>
<volume>5</volume>
<page-range>55-71</page-range></nlm-citation>
</ref>
<ref id="B82">
<label>82</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[YOUSEFIKHOSHBAKHT]]></surname>
<given-names><![CDATA[Majid]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A modified column generation to solve the heterogeneous fixed Fleet open vehicle routing problem]]></article-title>
<source><![CDATA[Journal of Engineering]]></source>
<year>2016</year>
</nlm-citation>
</ref>
<ref id="B83">
<label>83</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[YU]]></surname>
<given-names><![CDATA[Shiwei.]]></given-names>
</name>
<name>
<surname><![CDATA[DING]]></surname>
<given-names><![CDATA[Chang.]]></given-names>
</name>
<name>
<surname><![CDATA[ZHU]]></surname>
<given-names><![CDATA[Ding]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid GA-TS algorithm for open vehicle routing optimization of coal mines material]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2011</year>
<volume>38</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>10568-73</page-range></nlm-citation>
</ref>
<ref id="B84">
<label>84</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[ZACHARIADIS]]></surname>
<given-names><![CDATA[Emmanouil]]></given-names>
</name>
<name>
<surname><![CDATA[KIRANOUDIS]]></surname>
<given-names><![CDATA[Chris]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An open vehicle routing problem metaheuristic for examining wide solution neighborhoods]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2010</year>
<volume>37</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>712-23</page-range></nlm-citation>
</ref>
<ref id="B85">
<label>85</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[ZHANG]]></surname>
<given-names><![CDATA[Jingling]]></given-names>
</name>
<name>
<surname><![CDATA[ZHAO]]></surname>
<given-names><![CDATA[Yanwey]]></given-names>
</name>
<name>
<surname><![CDATA[PENG]]></surname>
<given-names><![CDATA[Dianjun]]></given-names>
</name>
<name>
<surname><![CDATA[WANG]]></surname>
<given-names><![CDATA[Wanliang]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid quantum-inspired evolutionary algorithm for open vehicle routing problem]]></article-title>
<source><![CDATA[Advanced Intelligent Mechatronics]]></source>
<year>2009</year>
<page-range>839-44</page-range></nlm-citation>
</ref>
<ref id="B86">
<label>86</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[ZHAO]]></surname>
<given-names><![CDATA[Yan]]></given-names>
</name>
<name>
<surname><![CDATA[ZHANG]]></surname>
<given-names><![CDATA[J.L]]></given-names>
</name>
<name>
<surname><![CDATA[PENG]]></surname>
<given-names><![CDATA[D.J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Open vehicle routing problem using quantum evolutionary algorithm]]></article-title>
<source><![CDATA[Advanced Materials Research]]></source>
<year>2010</year>
<volume>102-104</volume>
<page-range>807-12</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
