Application of the artificial bee colony algorithm for solving the set covering problem.

The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost s...

Descripción completa

Detalles Bibliográficos
Publicado en:Scientific World Journal pp. 189164 - 189165
Autores principales: Crawford, Broderick, Soto, Ricardo, Cuesta, Rodrigo, Paredes, Fernando
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=103826024&site=ehost-live
header:
  @attributes:
    shortDbName: ccm
    uiTerm: 103826024
    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:
        103826024
        103826024
        NLM24883356
        2012601860
        10.1155/2014/189164
        NLM24883356
        PMC4030563
        103826024
      ppf: 189164
      ppct: 1
      formats:
      tig:
        atl: Application of the artificial bee colony algorithm for solving the set covering problem.
      aug:
        au:
          Crawford, Broderick
          Soto, Ricardo
          Cuesta, Rodrigo
          Paredes, Fernando
        affil: Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile ; Universidad Finis Terrae, 7500000 Santiago, Chile.
      sug:
        subj:
          Algorithms
          Artificial Intelligence
          Bees and Wasps
          Behavior, Animal
          Models, Statistical
          Models, Theoretical
      ab: The set covering problem is a formal model for many practical optimization problems. In the set covering problem the goal is to choose a subset of the columns of minimal cost that covers every row. Here, we present a novel application of the artificial bee colony algorithm to solve the non-unicost set covering problem. The artificial bee colony algorithm is a recent swarm metaheuristic technique based on the intelligent foraging behavior of honey bees. Experimental results show that our artificial bee colony algorithm is competitive in terms of solution quality with other recent metaheuristic approaches for the set covering problem.
      pubtype: Academic Journal
      doctype:
        research
        Journal Article
      ougenre: Article
    language: English
    refInfo:
    holdings:
      @attributes:
        islocal: N