<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462025000100365</article-id>
<article-id pub-id-type="doi">10.13053/cys-29-1-4842</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A Cooperative Algorithm to Tackle the Truck and Trailer Routing Problem]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Pérez-Rodríguez]]></surname>
<given-names><![CDATA[Ricardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Urbán-Rivero]]></surname>
<given-names><![CDATA[Luis Eduardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,dr.ricardo.perez.rodriguez@gmail.com  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Instituto Tecnológico Autónomo de México  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2025</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2025</year>
</pub-date>
<volume>29</volume>
<numero>1</numero>
<fpage>365</fpage>
<lpage>375</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462025000100365&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462025000100365&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462025000100365&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: In this paper, we proposed a cooperative algorithm to resolve the truck and trailer routing problem. In this proposal, each member of the population does not represent a complete solution as in almost any evolutionary algorithm. In addition, for each member, an aptitude is not possible to compute based only on its codification, because the member has only partial information of the solution. All the members of the population have partial information of the solution. Therefore, these members need to cooperate to obtain an aptitude for the entire population. Although diverse methods and strategies have been used to solve the TTRP, this paper contributes to the state of the art by the use of the idea of the absence of recombination. We adopt the idea of no communication among members of the population. This way of computing fitness is clearly a gap in the literature, and must be investigated. Enough experimental results are shown that the cooperative algorithm is competitive against other current evolutionary algorithms. There no exist statistically significant difference between the cooperative algorithm and the others. It means that the CoopA is a new approach to continue developing.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Cooperative algorithm]]></kwd>
<kwd lng="en"><![CDATA[evolutionary algorithms]]></kwd>
<kwd lng="en"><![CDATA[vehicle routing problems]]></kwd>
<kwd lng="en"><![CDATA[set-partitioning model]]></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[Absi]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Cattaruzza]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Feillet]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Housseman]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A relax-and-repair heuristic for the swap-body vehicle routing problem]]></article-title>
<source><![CDATA[Annals of Operations Research]]></source>
<year>2017</year>
<volume>253</volume>
<page-range>957-78</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bodin]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Levy]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Scheduling of local delivery carrier routes for the United States postal service]]></article-title>
<source><![CDATA[Arc Routing: theory, solutions and applications]]></source>
<year>2000</year>
<page-range>419-42</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boudia]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Reghioui]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[An effective memetic algorithm with population management for the split delivery vehicle routing problem]]></source>
<year>2007</year>
<conf-name><![CDATA[ Hybrid Metaheuristics: 4th International Workshop, HM 2007]]></conf-name>
<conf-date>October 8-9, 2007</conf-date>
<conf-loc>Dortmund, Germany </conf-loc>
<page-range>16-30</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chao]]></surname>
<given-names><![CDATA[I.-M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A tabu search method for the truck and trailer routing problem]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2002</year>
<volume>29</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>33-51</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Del Pia]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Filippi]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A variable neighborhood descent algorithm for a real waste collection problem with mobile depots]]></article-title>
<source><![CDATA[International Transactions in Operational Research]]></source>
<year>2006</year>
<volume>13</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>125-41</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Derigs]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Pullmann]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Vogel]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Truck and trailer routing&#8212;problems, heuristics and computational experience]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2013</year>
<volume>40</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>536-46</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fathollahi-Fard]]></surname>
<given-names><![CDATA[A. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ranjbar-Bourani]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Cheikhrouhou]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Hajiaghaei-Keshteli]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Novel modifications of social engineering optimizer to solve a truck scheduling problem in a cross-docking system]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2019</year>
<volume>137</volume>
<page-range>106103</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gerdessen]]></surname>
<given-names><![CDATA[J. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Vehicle routing problem with trailers]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>1996</year>
<volume>93</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>135-47</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hoff]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Lokketangen]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[A tabu search approach for milk collection in western norway using trucks and trailers]]></source>
<year>2008</year>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Labadi]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Reghioui]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A memetic algorithm for the vehicle routing problem with time windows]]></article-title>
<source><![CDATA[RAIRO-Operations research]]></source>
<year>2008</year>
<volume>42</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>415-31</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[S.-W.]]></given-names>
</name>
<name>
<surname><![CDATA[Vincent]]></surname>
<given-names><![CDATA[F. Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Chou]]></surname>
<given-names><![CDATA[S.-Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving the truck and trailer routing problem based on a simulated annealing heuristic]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2009</year>
<volume>36</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>1683-92</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Maghfiroh]]></surname>
<given-names><![CDATA[M. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Hanaoka]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dynamic truck and trailer routing problem for last mile distribution in disaster response]]></article-title>
<source><![CDATA[Journal of Humanitarian Logistics and Supply Chain Management]]></source>
<year>2018</year>
<volume>8</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>252-78</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mart]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Pardalos]]></surname>
<given-names><![CDATA[P. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Resende]]></surname>
<given-names><![CDATA[M. G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of heuristics]]></source>
<year>2018</year>
<publisher-name><![CDATA[Springer Publishing Company, Incorporated]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A simple and effective evolutionary algorithm for the vehicle routing problem]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2004</year>
<volume>31</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>1985-2002</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Lacomme]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Prodhon]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Order-first split-second methods for vehicle routing problems: A review]]></article-title>
<source><![CDATA[Transportation Research Part C: Emerging Technologies]]></source>
<year>2014</year>
<volume>40</volume>
<page-range>179-200</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Renaud]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Boctor]]></surname>
<given-names><![CDATA[F. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Laporte]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved petal heuristic for the vehicle routeing problem]]></article-title>
<source><![CDATA[Journal of the operational Research Society]]></source>
<year>1996</year>
<volume>47</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>329-36</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ryan]]></surname>
<given-names><![CDATA[D. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hjorring]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Glover]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Extensions of the petal method for vehicle routeing]]></article-title>
<source><![CDATA[Journal of the Operational Research Society]]></source>
<year>1993</year>
<volume>44</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>289-96</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Scheuerer]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A tabu search heuristic for the truck and trailer routing problem]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2006</year>
<volume>33</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>894-909</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Semet]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A two-phase algorithm for the partial accessibility constrained vehicle routing problem]]></article-title>
<source><![CDATA[Annals of Operations Research]]></source>
<year>1995</year>
<volume>61</volume>
<page-range>45-65</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Theophilus]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Dulebenets]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pasha]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Lau]]></surname>
<given-names><![CDATA[Y.-y.]]></given-names>
</name>
<name>
<surname><![CDATA[Fathollahi-Fard]]></surname>
<given-names><![CDATA[A. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Mazaheri]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Truck scheduling optimization at a cold-chain cross-docking terminal with product perishability considerations]]></article-title>
<source><![CDATA[Computers &amp; Industrial Engineering]]></source>
<year>2021</year>
<volume>156</volume>
<page-range>107240</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Upton]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Cook]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<source><![CDATA[A dictionary of statistics 3e. Oxford quick reference]]></source>
<year>2014</year>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vahrenkamp]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Transportation logistic in rural setting: the case of milk collection]]></source>
<year>1989</year>
<volume>5</volume>
<page-range>1989</page-range><publisher-name><![CDATA[Department of Business and Economics, University of Kassel]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Villegas]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Prodhon]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Medaglia]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Velasco]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[GRASP/VND with path-relinking for the truck and trailer routing problem]]></source>
<year>2010</year>
<conf-name><![CDATA[ TRISTAN VII (7th triennial symposium on transportation analysis)]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Villegas]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Prodhon]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Medaglia]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Velasco]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Heuristic column generation for the truck and trailer routing problem]]></source>
<year>2011</year>
<conf-name><![CDATA[ ROUTE]]></conf-name>
<conf-date>2011</conf-date>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Villegas]]></surname>
<given-names><![CDATA[J. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Prodhon]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Medaglia]]></surname>
<given-names><![CDATA[A. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Velasco]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Grasp/vnd and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots]]></article-title>
<source><![CDATA[Engineering Applications of Artificial Intelligence]]></source>
<year>2010</year>
<volume>23</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>780-94</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Villegas]]></surname>
<given-names><![CDATA[J. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Prins]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Prodhon]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Medaglia]]></surname>
<given-names><![CDATA[A. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Velasco]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A matheuristic for the truck and trailer routing problem]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2013</year>
<volume>230</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>231-44</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A self-adaptive bat algorithm for the truck and trailer routing problem]]></article-title>
<source><![CDATA[Engineering Computations]]></source>
<year>2018</year>
<volume>35</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>108-35</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Lu]]></surname>
<given-names><![CDATA[C.-C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An ant colony system for solving the truck and trailer routing problem]]></article-title>
<source><![CDATA[J. Chin. Inst. Transp]]></source>
<year>2011</year>
<volume>23</volume>
<page-range>199-218</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yuan]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Fu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Cui]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Truck and trailer routing problem solving by a backtracking search algorithm]]></article-title>
<source><![CDATA[Journal of Systems Science and Information]]></source>
<year>2020</year>
<volume>8</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>253-72</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
