The expanded invasive weed optimization metaheuristic for solving continuous and discrete optimization problems.

This paper introduces an expanded version of the Invasive Weed Optimization algorithm (exIWO) distinguished by the hybrid strategy of the search space exploration proposed by the authors. The algorithm is evaluated by solving three well-known optimization problems: minimization of numerical function...

Descripción completa

Detalles Bibliográficos
Publicado en:Scientific World Journal pp. 831691 - 831692
Autores principales: Josinski, Henryk, Kostrzewa, Daniel, Michalczuk, Agnieszka, Switonski, Adam, Josiński, Henryk, Switoński, Adam
Formato: research 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=103830480&site=ehost-live
header:
  @attributes:
    shortDbName: ccm
    uiTerm: 103830480
    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:
        103830480
        103830480
        NLM24955420
        2012628228
        10.1155/2014/831691
        NLM24955420
        PMC3977471
        103830480
      ppf: 831691
      ppct: 1
      formats:
      tig:
        atl: The expanded invasive weed optimization metaheuristic for solving continuous and discrete optimization problems.
      aug:
        au:
          Josinski, Henryk
          Kostrzewa, Daniel
          Michalczuk, Agnieszka
          Switonski, Adam
          Josiński, Henryk
          Switoński, Adam
        affil: Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland
      sug:
        subj:
          Algorithms
          Problem Solving
      ab: This paper introduces an expanded version of the Invasive Weed Optimization algorithm (exIWO) distinguished by the hybrid strategy of the search space exploration proposed by the authors. The algorithm is evaluated by solving three well-known optimization problems: minimization of numerical functions, feature selection, and the Mona Lisa TSP Challenge as one of the instances of the traveling salesman problem. The achieved results are compared with analogous outcomes produced by other optimization methods reported in the literature.
      pubtype: Academic Journal
      doctype:
        research
        Journal Article
      ougenre: Article
    language: English
    refInfo:
    holdings:
      @attributes:
        islocal: N