A novel hybrid self-adaptive bat algorithm.

Nature-inspired algorithms attract many researchers worldwide for solving the hardest optimization problems. One of the newest members of this extensive family is the bat algorithm. To date, many variants of this algorithm have emerged for solving continuous as well as combinatorial problems. One of...

Descripción completa

Detalles Bibliográficos
Publicado en:Scientific World Journal pp. 709738 - 709739
Autores principales: Fister Jr, Iztok, Fong, Simon, Brest, Janez, Fister, Iztok, Fister, Iztok Jr
Formato: Journal Article
Publicado: Wiley-Blackwell 2014
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=103843074&site=ehost-live
header:
  @attributes:
    shortDbName: ccm
    uiTerm: 103843074
    longDbName: CINAHL Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    dissinfo:
    jinfo:
      jid:
        1537744X
        1BX5
      jtl: Scientific World Journal
      issn: 1537744X
      maglogo: N
    pubinfo:
      dt: 2014
      pid: 480
      pub: Wiley-Blackwell
      place: Malden, Massachusetts
    artinfo:
      ui:
        103843074
        NLM25187904
        2012705061
        10.1155/2014/709738
        NLM25187904
        PMC4000672
        103843074
      ppf: 709738
      ppct: 1
      formats:
      tig:
        atl: A novel hybrid self-adaptive bat algorithm.
      aug:
        au:
          Fister Jr, Iztok
          Fong, Simon
          Brest, Janez
          Fister, Iztok
          Fister, Iztok Jr
        affil: Faculty of Electrical Engineering and Computer Science, University of Maribor, Smetanova 17, 2000 Maribor, Slovenia
      sug:
        subj:
          Algorithms
          Feedback
      ab: Nature-inspired algorithms attract many researchers worldwide for solving the hardest optimization problems. One of the newest members of this extensive family is the bat algorithm. To date, many variants of this algorithm have emerged for solving continuous as well as combinatorial problems. One of the more promising variants, a self-adaptive bat algorithm, has recently been proposed that enables a self-adaptation of its control parameters. In this paper, we have hybridized this algorithm using different DE strategies and applied these as a local search heuristics for improving the current best solution directing the swarm of a solution towards the better regions within a search space. The results of exhaustive experiments were promising and have encouraged us to invest more efforts into developing in this direction.
      pubtype: Academic Journal
      doctype: Journal Article
      ougenre: Article
    language: English
    refInfo:
    holdings:
      @attributes:
        islocal: N