<?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-55462018000200491</article-id>
<article-id pub-id-type="doi">10.13053/cys-22-2-2956</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Genetic Algorithm for Solving Multiple Traveling Salesmen Problem using a New Crossover and Population Generation]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Singh]]></surname>
<given-names><![CDATA[Dharm Raj]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Singh]]></surname>
<given-names><![CDATA[Manoj Kumar]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Singh]]></surname>
<given-names><![CDATA[Tarkeshwar]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Prasad]]></surname>
<given-names><![CDATA[Rajkishore]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Banaras Hindu University  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>India</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Birla Institute of Technology and Science Pilani Department of Mathematics ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>India</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,B.N. College  ]]></institution>
<addr-line><![CDATA[Patna ]]></addr-line>
<country>India</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2018</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2018</year>
</pub-date>
<volume>22</volume>
<numero>2</numero>
<fpage>491</fpage>
<lpage>503</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462018000200491&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-55462018000200491&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-55462018000200491&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: In this paper, we proposed a new crossover operator and a population initialization method for solving multiple traveling salesmen (MTSP) problem in genetic algorithm (GA) framework. The group theory based technique of intital population generation ensures the uniqueness of members in population, hence no redundancy in the search space and also remove the random initialization effect. The new crossover is based on the intuitive idea that the city in sub optimal / optimal tours occurs at same position. In this crossover the Hamming distance is preserved and there is very less chance to generate child same as members in the population, so diversity of the population is not much affected. For efficient representation of search space, we exploited the multi-chromosome representation technique to encode the search space of MTSP. We evaluate and compare the proposed technique with the methods using crossover TCX, ORX +A, CYX +A and PMX +A reported in [35] for two standard objective functions of the MTSP, namely, minimising total travel cost of m tours of the m salesman and minimising the longest tour cast travel by any one salesman. Experimental results show that the GA with proposed population initialization and crossover gives better result compared to all four methods for second objective, however, in very few cases slightly degraded result for first objective.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Genetic algorithm]]></kwd>
<kwd lng="en"><![CDATA[multiple traveling salesman problem]]></kwd>
<kwd lng="en"><![CDATA[group theory]]></kwd>
<kwd lng="en"><![CDATA[crossover operator]]></kwd>
<kwd lng="en"><![CDATA[2-opt mutation]]></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[Albayrak]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Allahverdi]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2011</year>
<volume>38</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>1313-20</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[Kiraly]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Abonyi]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimization of MTSP by novel representation based on genetic algorithm]]></article-title>
<source><![CDATA[Intelligent Computing Optimization in Engneering]]></source>
<year>2011</year>
<page-range>241-69</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[Angel]]></surname>
<given-names><![CDATA[R.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Caudle]]></surname>
<given-names><![CDATA[W.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Noonan]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Whinston]]></surname>
<given-names><![CDATA[A.N.D.A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Computer-assisted school bus scheduling]]></article-title>
<source><![CDATA[Management Science]]></source>
<year>1972</year>
<volume>18</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>B-279</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[Bektas]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The multiple traveling salesman problem: an overview of formulations and solution procedures]]></article-title>
<source><![CDATA[Omega]]></source>
<year>2006</year>
<volume>34</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>209-19</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[Brown]]></surname>
<given-names><![CDATA[E.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Ragsdale]]></surname>
<given-names><![CDATA[C.T.]]></given-names>
</name>
<name>
<surname><![CDATA[Carter]]></surname>
<given-names><![CDATA[A.E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A grouping genetic algorithm for the multiple traveling salesperson problem]]></article-title>
<source><![CDATA[International Journal of Information Technology &amp; Decision Making]]></source>
<year>2007</year>
<volume>6</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>333-47</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[Carter]]></surname>
<given-names><![CDATA[A.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ragsdale]]></surname>
<given-names><![CDATA[C.T.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new approach to solving the multiple traveling salesperson problem using genetic algorithms]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>2006</year>
<volume>175</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>246-57</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[Chen]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution]]></article-title>
<source><![CDATA[Physica A: Statistical Mechanics and its Applications]]></source>
<year>2006</year>
<volume>371</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>627-32</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[Croes]]></surname>
<given-names><![CDATA[G.A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A method for solving traveling-salesman problems]]></article-title>
<source><![CDATA[Operations research]]></source>
<year>1958</year>
<volume>6</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>791-812</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Davis]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of Genetic Algorithms]]></source>
<year>1991</year>
<publisher-name><![CDATA[Van Nostrand Reinhold New York Google Scholar]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Falkenauer]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic algorithms and grouping problems]]></source>
<year>1998</year>
<publisher-name><![CDATA[John Wiley &amp; Sons, Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Freisleben]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Merz]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems]]></source>
<year>1996</year>
<conf-name><![CDATA[ Evolutionary Computation Proceedings of IEEE International Conference]]></conf-name>
<conf-loc> </conf-loc>
<page-range>616-21</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[Gilbert]]></surname>
<given-names><![CDATA[K.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Hofstra]]></surname>
<given-names><![CDATA[R.B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new multiperiod multiple traveling salesman problem with heuristic and application to a scheduling problem]]></article-title>
<source><![CDATA[Decision Sciences]]></source>
<year>1992</year>
<volume>23</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>250-9</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Goldberg]]></surname>
<given-names><![CDATA[E.D]]></given-names>
</name>
</person-group>
<source><![CDATA[Genetic Algorithms in Search, Optimisation and Machine Learning]]></source>
<year>1989</year>
<publisher-name><![CDATA[Adison Wesley PC]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gorenstein]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Printing press scheduling for multi-edition periodicals]]></article-title>
<source><![CDATA[Management Science]]></source>
<year>1970</year>
<volume>16</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>B-373</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gutin]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Punnen]]></surname>
<given-names><![CDATA[A.P.]]></given-names>
</name>
</person-group>
<source><![CDATA[The traveling salesman problem and its variations]]></source>
<year>2006</year>
<volume>12</volume>
<publisher-name><![CDATA[Springer Science &amp; Business Media]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Helsgaun]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An effective implementation of the Lin-Kernighan traveling salesman heuristic]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>2000</year>
<volume>126</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>106-30</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hao]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Preliminary Analysis on the Relative Solution Space Sizes for MTSP with Genetic Algorithm]]></article-title>
<source><![CDATA[Intelligent Computing and Information Science]]></source>
<year>2011</year>
<page-range>649-55</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[Jeong]]></surname>
<given-names><![CDATA[C.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[M.H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections]]></article-title>
<source><![CDATA[Parallel computing]]></source>
<year>1991</year>
<volume>17</volume>
<numero>2-3</numero>
<issue>2-3</issue>
<page-range>221-8</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[Johnson]]></surname>
<given-names><![CDATA[D.S.]]></given-names>
</name>
<name>
<surname><![CDATA[McGeoch]]></surname>
<given-names><![CDATA[L.A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The traveling salesman problem: A case study in local optimization]]></article-title>
<source><![CDATA[Local search in combinatorial optimization]]></source>
<year>1997</year>
<volume>1</volume>
<page-range>215-310</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[Karp]]></surname>
<given-names><![CDATA[R.M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Patching Algorithm for the Nonsymmetric Traveling Salesman Problem]]></article-title>
<source><![CDATA[SIAM J. Computing]]></source>
<year>1979</year>
<volume>8</volume>
<page-range>561-73</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Zheng]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[An ant colony optimization algorithm for the multiple traveling salesmen problem]]></source>
<year>2009</year>
<conf-name><![CDATA[ 4th IEEE Conference Industrial Electronics and Applications, (ICIEA)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1533-7</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[Louis]]></surname>
<given-names><![CDATA[S.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Case injected genetic algorithms for traveling salesman problems]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2000</year>
<volume>122</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>201-25</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[Malmborg]]></surname>
<given-names><![CDATA[C.J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm for service level based vehicle scheduling]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>1996</year>
<volume>93</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>121-34</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[Marinakis]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Marinaki]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem]]></article-title>
<source><![CDATA[Computers &amp; Operations Research]]></source>
<year>2010</year>
<volume>37</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>432-42</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[Okonjo-Adigwe]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An effective method of balancing the workload amongst salesmen]]></article-title>
<source><![CDATA[Omega]]></source>
<year>1988</year>
<volume>16</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>159-63</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Oliver]]></surname>
<given-names><![CDATA[I.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Holland]]></surname>
<given-names><![CDATA[J.R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Study of permutation crossover operators on the traveling salesman problem]]></source>
<year>1987</year>
<conf-name><![CDATA[ second International Conference on Genetic Algorithms]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B27">
<label>27</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Park]]></surname>
<given-names><![CDATA[Y.B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines]]></article-title>
<source><![CDATA[International Journal of Production Economics]]></source>
<year>2001</year>
<volume>73</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>175-88</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[Reinelt]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<source><![CDATA[The traveling salesman: computational solutions for TSP applications]]></source>
<year>1994</year>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B29">
<label>29</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rosen]]></surname>
<given-names><![CDATA[K.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Krithivasan]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[Discrete mathematics and its applications: with combinatorics and graph theory]]></source>
<year>2012</year>
<publisher-name><![CDATA[Tata McGraw-Hill Education]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Saleh]]></surname>
<given-names><![CDATA[H.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chelouah]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The design of the global navigation satellite system surveying networks using genetic algorithms]]></article-title>
<source><![CDATA[Engineering Applications of Artificial Intelligence]]></source>
<year>2004</year>
<volume>17</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>111-22</page-range></nlm-citation>
</ref>
<ref id="B31">
<label>31</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Singh]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Baghel]]></surname>
<given-names><![CDATA[A.S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new grouping genetic algorithm approach to the multiple traveling salesperson problem]]></article-title>
<source><![CDATA[Soft Computing-A Fusion of Foundations, Methodologies and Applications]]></source>
<year>2009</year>
<volume>13</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>95-101</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[Song]]></surname>
<given-names><![CDATA[C.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[W.D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Extended simulated annealing for augmented TSP and multi-salesmen TSP. In Neural Networks]]></article-title>
<source><![CDATA[Proceedings of the International Joint Conference]]></source>
<year>2003</year>
<volume>3</volume>
<page-range>2340-3</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>33</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Syswerda]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Schedule optimization using genetic algorithms]]></article-title>
<source><![CDATA[Handbook of genetic algorithms]]></source>
<year>1991</year>
</nlm-citation>
</ref>
<ref id="B34">
<label>34</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Rong]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron &amp; Steel Complex]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>2000</year>
<volume>124</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>267-82</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[Venkatesh]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Singh]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Two metaheuristic approaches for the multiple traveling salesperson problem]]></article-title>
<source><![CDATA[Applied Soft Computing]]></source>
<year>2015</year>
<volume>26</volume>
<page-range>74-89</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[Yousefikhoshbakht]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Didehvar]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Rahmati]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modification of the ant colony optimization for solving the multiple traveling salesman problem]]></article-title>
<source><![CDATA[Romanian Journal of Information Science and Technology]]></source>
<year>2013</year>
<volume>16</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>65-80</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[Yuan]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Skinner]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>2013</year>
<volume>228</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>72-82</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[Yuan]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Skinner]]></surname>
<given-names><![CDATA[B.T.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[D.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Dissanayake]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Lau]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Pagac]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A job grouping approach for planning container transfers at automated seaport container terminals]]></article-title>
<source><![CDATA[Advanced Engineering Informatics]]></source>
<year>2011</year>
<volume>25</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>413-26</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[Zhang]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<source><![CDATA[Truncated Branch-and-Bound: A Case Study on the Asymmetric TSP]]></source>
<year>1993</year>
<conf-name><![CDATA[ Proceedings of Spring Symposium on AI and NP-Hard Problems]]></conf-name>
<conf-loc> </conf-loc>
<page-range>160-6</page-range></nlm-citation>
</ref>
<ref id="B40">
<label>40</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<source><![CDATA[Depth-First Branch-and-Bound versus Local Search: A Case Study]]></source>
<year>2000</year>
<conf-name><![CDATA[ 17th National Conference on Artificial Intelligence (AAAI)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>930-5</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
