<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-018-13-1853</article-id>
      <article-id pub-id-type="publisher-id">23799</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>C.2.m - Miscellaneous</subject>
          <subject>F.2 - ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY</subject>
          <subject>G.1.10 - Applications</subject>
          <subject>G.1.6 - Optimization</subject>
          <subject>I.6 - SIMULATION AND MODELING</subject>
          <subject>J.0 - GENERAL</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Two Local Search Strategies for Differential Evolution</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Ali</surname>
            <given-names>Musrrat</given-names>
          </name>
          <email xlink:type="simple">musrrat.iitr@gmail.com</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Pant</surname>
            <given-names>Millie</given-names>
          </name>
          <xref ref-type="aff" rid="A2">2</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Nagar</surname>
            <given-names>Atulya K.</given-names>
          </name>
          <xref ref-type="aff" rid="A3">3</xref>
        </contrib>
        <contrib contrib-type="author" corresp="no">
          <name name-style="western">
            <surname>Ahn</surname>
            <given-names>Chang Wook</given-names>
          </name>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Sungkyunkwan University, Suwon, Republic of Korea</addr-line>
        <institution>Sungkyunkwan University</institution>
        <addr-line content-type="city">Suwon</addr-line>
        <country>Republic of Korea</country>
      </aff>
      <aff id="A2">
        <label>2</label>
        <addr-line content-type="verbatim">Indian Institute of Technology Roorkee, Saharanpur, India</addr-line>
        <institution>Indian Institute of Technology Roorkee</institution>
        <addr-line content-type="city">Saharanpur</addr-line>
        <country>India</country>
      </aff>
      <aff id="A3">
        <label>3</label>
        <addr-line content-type="verbatim">Liverpool Hope University, Liverpool, United Kingdom</addr-line>
        <institution>Liverpool Hope University</institution>
        <addr-line content-type="city">Liverpool</addr-line>
        <country>United Kingdom</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Musrrat Ali (<email xlink:type="simple">musrrat.iitr@gmail.com</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2012</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>01</day>
        <month>07</month>
        <year>2012</year>
      </pub-date>
      <volume>18</volume>
      <issue>13</issue>
      <fpage>1853</fpage>
      <lpage>1870</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/C5EDEDCE-94DD-50D5-B7FA-ADE9FBB49D9D">C5EDEDCE-94DD-50D5-B7FA-ADE9FBB49D9D</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/5505927">5505927</uri>
      <history>
        <date date-type="received">
          <day>15</day>
          <month>11</month>
          <year>2011</year>
        </date>
        <date date-type="accepted">
          <day>30</day>
          <month>03</month>
          <year>2012</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>Musrrat Ali, Millie Pant, Atulya K. Nagar, Chang Wook Ahn</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>Insertion of a local search technique is often considered an effective mechanism to increase the efficiency of a global optimization algorithm. In this paper we propose and analyze the effect of two local searches namely; Trigonometric Local Search (TLS) and Interpolated Local Search (ILS) on the working of basic Differential Evolution (DE). The corresponding algorithms are named as DETLS and DEILS. The performances of proposed algorithms are investigated and compared with basic DE, modified versions of DE and some other evolutionary algorithms. It is found that the proposed schemes improve the performance of DE in terms of quality of solution without compromising with the convergence rate.</p>
      </abstract>
    </article-meta>
  </front>
</article>
