<?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>0120-5609</journal-id>
<journal-title><![CDATA[Ingeniería e Investigación]]></journal-title>
<abbrev-journal-title><![CDATA[Ing. Investig.]]></abbrev-journal-title>
<issn>0120-5609</issn>
<publisher>
<publisher-name><![CDATA[Facultad de Ingeniería, Universidad Nacional de Colombia.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0120-56092019000300044</article-id>
<article-id pub-id-type="doi">10.15446/ing.investig.v39n3.81161</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Performance measurement of a solution for the travelling salesman problem for routing through the incorporation of service time variability]]></article-title>
<article-title xml:lang="es"><![CDATA[Medición del desempeño de una solución del problema de agente viajero para ruteo a través de la incorporación de la variabilidad de los tiempos de servicio]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Lagos]]></surname>
<given-names><![CDATA[Dafne]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mancilla]]></surname>
<given-names><![CDATA[Rodrigo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Leal]]></surname>
<given-names><![CDATA[Paola]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Fox]]></surname>
<given-names><![CDATA[Franco]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Católica de Temuco  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Chile</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Católica de Temuco  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Chile</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Católica de Temuco  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Chile</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Universidad Católica de Temuco  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Chile</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2019</year>
</pub-date>
<volume>39</volume>
<numero>3</numero>
<fpage>44</fpage>
<lpage>49</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0120-56092019000300044&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0120-56092019000300044&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0120-56092019000300044&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT This work assessed the performance of a solution to the problem of assigning service squads, incorporating the variability of service times. The initial problem was modelled as a Travelling Salesman Problem (TSP), whose solution was obtained by the ant colony algorithm, showing the efficient route to be followed by the squad. Assessment of the performance of the solution by discrete event simulation (DES) included the travel time and added the service time. The TSP solution indicated that up to six customer visits could be carried out in an 8-hour working day. Validation by DES presented a stable behavior of the variance, regardless of the number of visit sites assigned along the route.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN En este trabajo, se evaluó el desempeño de una solución del problema de asignación de brigadas al incorporar la variabilidad de los tiempos de servicio. La problemática inicial se modeló como un problema de agente viajero (TSP), cuya solución se obtuvo por medio del algoritmo colonia de hormigas y mostró la ruta eficiente que debe seguir una brigada. La evaluación del desempeño de la solución, a través de simulación de eventos discretos (DES), consideró el tiempo de recorrido y agregó el tiempo del servicio. La evaluación de desempeño de la solución del modelo TSP indicó que se pueden visitar hasta seis clientes en una jornada laboral diaria de 8 horas. El modelo de validación mediante DES presentó un comportamiento estable de la varianza, independientemente de la cantidad de puntos asignados a visitar dentro de la ruta.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Traveling salesmen problem (TSP)]]></kwd>
<kwd lng="en"><![CDATA[performance]]></kwd>
<kwd lng="en"><![CDATA[discrete event simulation (DES)]]></kwd>
<kwd lng="en"><![CDATA[service time]]></kwd>
<kwd lng="es"><![CDATA[Problema del agente viajero (TSP)]]></kwd>
<kwd lng="es"><![CDATA[desempeño]]></kwd>
<kwd lng="es"><![CDATA[simulación de eventos discretos (DES)]]></kwd>
<kwd lng="es"><![CDATA[tiempo de servicio]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alkaya]]></surname>
<given-names><![CDATA[A. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Duman]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new generalization of the traveling salesman problem]]></article-title>
<source><![CDATA[Applied and Computational Mathematics]]></source>
<year>2010</year>
<volume>9</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>162-75</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Anaya Fuentes]]></surname>
<given-names><![CDATA[G. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Hernández Gress]]></surname>
<given-names><![CDATA[E. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Seck Tuoh Mora]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Medina Marín]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solution of the job-shop scheduling problem through the traveling salesman problem]]></article-title>
<source><![CDATA[RIAI - Revista Iberoamericana de Automática e Informática Industrial]]></source>
<year>2016</year>
<volume>13</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>430-7</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arias-Rojas]]></surname>
<given-names><![CDATA[J. S]]></given-names>
</name>
<name>
<surname><![CDATA[Jiménez]]></surname>
<given-names><![CDATA[J. F]]></given-names>
</name>
<name>
<surname><![CDATA[Montoya-Torres]]></surname>
<given-names><![CDATA[J. R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving of school bus routing problem by ant colony optimization]]></article-title>
<source><![CDATA[Revista EIA]]></source>
<year>2012</year>
<numero>17</numero>
<issue>17</issue>
<page-range>193-208</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arnesen]]></surname>
<given-names><![CDATA[M. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Gjestvang]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Fagerholt]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Thun]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Rakke]]></surname>
<given-names><![CDATA[J. G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A traveling salesman problem with pickups and deliveries, time windows and draft limits: Case study from chemical shipping]]></article-title>
<source><![CDATA[computers and operation Research]]></source>
<year>2017</year>
<volume>77</volume>
<page-range>20-31</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bernardino]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Paias]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving the family traveling salesman problem]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2018</year>
<volume>267</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>453-66</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[S. H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Minimization of the total traveling distance and maximum distance by using a transformed-based encoding eda to solve the multiple traveling salesmen problem]]></article-title>
<source><![CDATA[Mathematical Problems in Engineering]]></source>
<year>2015</year>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chládek]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Smetanová]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Travelling Salesman Problem Applied to Black Sea Ports Used By Czech Ocean Shipping Companies]]></article-title>
<source><![CDATA[Nase More]]></source>
<year>2018</year>
<volume>65</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>141-5</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dong]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Cai]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Artificial bee colony algorithm with generating neighbourhood solution for large scale coloured traveling salesman problem]]></article-title>
<source><![CDATA[IET Intelligent Transport Systems]]></source>
<year>2019</year>
<volume>13</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>1483-91</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Garg]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Analysis of an industrial system under uncertain environment by using different types of fuzzy numbers]]></article-title>
<source><![CDATA[International Journal of Systems Assurance Engineering and Management]]></source>
<year>2018</year>
<volume>9</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>525-38</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Metaheurísticas aplicadas al ruteo de vehículos. Un caso de estudio. Parte 2: algoritmo genético, comparación con una solución heurística]]></article-title>
<source><![CDATA[Ingeniería e Investigación]]></source>
<year>2007</year>
<volume>27</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>149-57</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ko]]></surname>
<given-names><![CDATA[S. Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Cho]]></surname>
<given-names><![CDATA[S. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Pricing and collaboration in last mile delivery services]]></article-title>
<source><![CDATA[Sustainability]]></source>
<year>2018</year>
<volume>10</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>45-60</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Krushel]]></surname>
<given-names><![CDATA[E. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Stepanchenko]]></surname>
<given-names><![CDATA[I. V.]]></given-names>
</name>
<name>
<surname><![CDATA[Panfilov]]></surname>
<given-names><![CDATA[A. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Berisheva]]></surname>
<given-names><![CDATA[E. D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An experience of optimization approach application to improve the urban passenger transport structure]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Kravets]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Shcherbakov]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Kultsova]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Iijima]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<source><![CDATA[Knowledge-Based software Engineering. JKBSE 2014]]></source>
<year>2014</year>
<month>,</month>
<publisher-loc><![CDATA[Cham ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Meng]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Dai]]></surname>
<given-names><![CDATA[X]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Collision-free scheduling of multi-bridge machining systems: A colored traveling salesman problem-based approach]]></article-title>
<source><![CDATA[IEEE/CAA Journal of Automatica sinica]]></source>
<year>2018</year>
<volume>5</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>139-47</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lynskey]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Thar]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[T. Z]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
<name>
<surname><![CDATA[Hong]]></surname>
<given-names><![CDATA[C. S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Facility location problem approach for distributed drones]]></article-title>
<source><![CDATA[Symmetry]]></source>
<year>2019</year>
<volume>11</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>118</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Meng]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Dai]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Dou]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Variable neighborhood search for a colored traveling salesman problem]]></article-title>
<source><![CDATA[IEEE Transactions on Intelligent Transportation Systems]]></source>
<year>2017</year>
<volume>19</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1018-26</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Niu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Performance optimization and simulation analysis of the railway communication network route search]]></article-title>
<source><![CDATA[Xitong Fangzhen Xuebao / Journal of System Simulation]]></source>
<year>2005</year>
<volume>17</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>468-71</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Osorio Gómez]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Castrillón Montenegro]]></surname>
<given-names><![CDATA[O. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Toro Cardona]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Orejuela Cabrera]]></surname>
<given-names><![CDATA[J. P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hierarchical production planning model in flexible job shop including a preemption and sequence-dependent setup times]]></article-title>
<source><![CDATA[Ingeniería e Investigacióon]]></source>
<year>2008</year>
<volume>28</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>72-9</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rubaiee]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Yildirim]]></surname>
<given-names><![CDATA[M. B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An energy-aware multiobjective ant colony algorithm to minimize total completion time and energy cost on a single-machine preemptive scheduling]]></article-title>
<source><![CDATA[Computers and Industrial Engineering]]></source>
<year>2019</year>
<volume>127</volume>
<page-range>240-52</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sabbani]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Omar]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Eszetergar-Kiss]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simulation results for a daily activity chain optimization method based on ant colony algorithm with time windows]]></article-title>
<source><![CDATA[International Journal of Advanced Computer Science and Applications]]></source>
<year>2019</year>
<volume>10</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>425-30</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tinarut]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Leksakul]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hybrid self-organizing map approach for traveling salesman problem]]></article-title>
<source><![CDATA[Chiang Mai University Journal of Natural Sciences]]></source>
<year>2019</year>
<volume>18</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>27-37</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Todosijevic]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Mjirda]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mladenovic]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hanafi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Gendron]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A general variable neighborhood search variants for the travelling salesman problem with draft limits]]></article-title>
<source><![CDATA[Optimization Letters]]></source>
<year>2017</year>
<volume>11</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>1047-56</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vartdal]]></surname>
<given-names><![CDATA[J. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Qassim]]></surname>
<given-names><![CDATA[R. Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Mokliev]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Udjus]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Gonzalez-Gorbena]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimal configuration problem identification of electrical power cable in tidal turbine farm traveling salesman problem modeling approach]]></article-title>
<source><![CDATA[Journal of Modern Power Systems and Clean Energy]]></source>
<year>2019</year>
<volume>7</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>289-96</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Guo]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Zheng]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Uncertain multiobjective traveling salesman problem]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2015</year>
<volume>241</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>478-89</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tensioning-phase box girder deformation prediction model based on ant colony algorithm and residual correction]]></article-title>
<source><![CDATA[Mathematical Problems in Engineering]]></source>
<year>2018</year>
</nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yen]]></surname>
<given-names><![CDATA[C. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Cheng]]></surname>
<given-names><![CDATA[M. F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A study of fuzzy control with ant colony algorithm used in mobile robotfor shortest path planning and obstacle avoidance]]></article-title>
<source><![CDATA[Microsystem Technologies]]></source>
<year>2018</year>
<volume>24</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>125-35</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Mei]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Yan]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Anewtestsetcompression scheme for circular scan]]></article-title>
<source><![CDATA[Eurasip Journal on Embedded Systems]]></source>
<year>2018</year>
<volume>2018</volume>
<numero>1</numero>
<issue>1</issue>
</nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid genetic and ant colony algorithm for finding the shortest path in dynamic traffic networks]]></article-title>
<source><![CDATA[Automatic control and computer Sciences]]></source>
<year>2018</year>
<volume>52</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>67-76</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[A. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhu]]></surname>
<given-names><![CDATA[L. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Deng]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Song]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Qiu]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Traveling-salesman-problem algorithm based on simulated annealing and gene-expression programming]]></article-title>
<source><![CDATA[Information]]></source>
<year>2019</year>
<volume>10</volume>
<numero>1</numero>
<issue>1</issue>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
