<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">605469237</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20210128100321.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">210128e20151201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00500-015-1896-x</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00500-015-1896-x</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A hybrid version of invasive weed optimization with quadratic approximation</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Y. Naidu, A. Ojha]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Invasive weed optimization (IWO) is a recent meta-heuristic optimization technique, based on the life cycle of plants. It has been applied in many engineering applications as well as in real world problems. In this paper, a hybrid version of IWO with the quadratic approximation (QA) operator, referred as QAIWO, has been investigated to improve the convergence rate of IWO while obtaining optimal solution. Additionally, we alleviate the limitation of QA (which is nothing but difficulty in escaping from a local optimum) by performing QA a predetermined number of times and then considering the average of all such solutions due to each iteration rather than a single solution. This technique makes our algorithm more efficient compared to the existing algorithms in the area. Twenty two benchmark problems and five real-life problems are adopted from literature to validate our proposed hybrid method QAIWO. The results of QAIWO are compared with the results obtained by the standard IWO and the well-known nature-inspired genetic algorithm (GA). These comparisons exhibit that QAIWO is more convenient to solve complex problems than using IWO and/or GA.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag Berlin Heidelberg, 2015</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Invasive weed optimization</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Quadratic approximation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Meta-heuristic optimization technique</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Performance index</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Naidu</subfield>
   <subfield code="D">Y.</subfield>
   <subfield code="u">Indian Institute of Technology, Bhubaneswar, India</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Ojha</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">Indian Institute of Technology, Bhubaneswar, India</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Soft Computing</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">19/12(2015-12-01), 3581-3598</subfield>
   <subfield code="x">1432-7643</subfield>
   <subfield code="q">19:12&lt;3581</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">500</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00500-015-1896-x</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/s00500-015-1896-x</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">Naidu</subfield>
   <subfield code="D">Y.</subfield>
   <subfield code="u">Indian Institute of Technology, Bhubaneswar, India</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">Ojha</subfield>
   <subfield code="D">A.</subfield>
   <subfield code="u">Indian Institute of Technology, Bhubaneswar, India</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">Soft Computing</subfield>
   <subfield code="d">Springer Berlin Heidelberg</subfield>
   <subfield code="g">19/12(2015-12-01), 3581-3598</subfield>
   <subfield code="x">1432-7643</subfield>
   <subfield code="q">19:12&lt;3581</subfield>
   <subfield code="1">2015</subfield>
   <subfield code="2">19</subfield>
   <subfield code="o">500</subfield>
  </datafield>
 </record>
</collection>
