<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">606158863</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100622.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20150101xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00521-014-1717-7</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00521-014-1717-7</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A similarity-based mechanism to control genetic algorithm and local search hybridization to solve traveling salesman problem</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Marjan Kuchaki Rafsanjani, Sadegh Eskandari, Arsham Borumand Saeid]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">A big shortcoming of the simple genetic algorithm is that whenever it converges to a local optimum, its performance is continuously deteriorating, especially in the highly nonlinear problems such as traveling salesman problem (TSP). Therefore, some heuristics such as local search are needed to help genetic algorithm (GA) loops escaping such situations. The critical point in such hybridization is the determining a suitable time for applying local search to the GA population. In this study, a new hybridization of GA and local search based on a new similarity-based control mechanism is proposed, and its behavior on different TSP instances is compared with simple GA. The experimental results show that the proposed hybrid algorithm yields the optimal tour length in most of the cases, especially in the TSP instances with higher complexity.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">The Natural Computing Applications Forum, 2014</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Genetic algorithm</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Local search</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Traveling salesman problem</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Similarity-based control</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Kuchaki Rafsanjani</subfield>
   <subfield code="D">Marjan</subfield>
   <subfield code="u">Department of Computer Science, Shahid Bahonar University of Kerman, Kerman, Iran</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Eskandari</subfield>
   <subfield code="D">Sadegh</subfield>
   <subfield code="u">Department of Computer Science, Shahid Bahonar University of Kerman, Kerman, Iran</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Borumand Saeid</subfield>
   <subfield code="D">Arsham</subfield>
   <subfield code="u">Department of Mathematics, Shahid Bahonar University of Kerman, Kerman, Iran</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Neural Computing and Applications</subfield>
   <subfield code="d">Springer London</subfield>
   <subfield code="g">26/1(2015-01-01), 213-222</subfield>
   <subfield code="x">0941-0643</subfield>
   <subfield code="q">26:1&lt;213</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">26</subfield>
   <subfield code="o">521</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00521-014-1717-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00521-014-1717-7</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Kuchaki Rafsanjani</subfield>
   <subfield code="D">Marjan</subfield>
   <subfield code="u">Department of Computer Science, Shahid Bahonar University of Kerman, Kerman, Iran</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Eskandari</subfield>
   <subfield code="D">Sadegh</subfield>
   <subfield code="u">Department of Computer Science, Shahid Bahonar University of Kerman, Kerman, Iran</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Borumand Saeid</subfield>
   <subfield code="D">Arsham</subfield>
   <subfield code="u">Department of Mathematics, Shahid Bahonar University of Kerman, Kerman, Iran</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Neural Computing and Applications</subfield>
   <subfield code="d">Springer London</subfield>
   <subfield code="g">26/1(2015-01-01), 213-222</subfield>
   <subfield code="x">0941-0643</subfield>
   <subfield code="q">26:1&lt;213</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">26</subfield>
   <subfield code="o">521</subfield>
  </datafield>
 </record>
</collection>
