Hybrid biogeography-based optimization for integer programming.

Biogeography-based optimization (BBO) is a relatively new bioinspired heuristic for global optimization based on the mathematical models of biogeography. By investigating the applicability and performance of BBO for integer programming, we find that the original BBO algorithm does not perform well o...

Descripción completa

Detalles Bibliográficos
Publicado en:Scientific World Journal pp. 672983 - 672984
Autores principales: Wang, Zhi-Cheng, Wu, Xiao-Bei
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=103832892&site=ehost-live
header:
  @attributes:
    shortDbName: ccm
    uiTerm: 103832892
    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:
        103832892
        NLM25003142
        2012642372
        10.1155/2014/672983
        NLM25003142
        PMC4065689
        103832892
      ppf: 672983
      ppct: 1
      formats:
      tig:
        atl: Hybrid biogeography-based optimization for integer programming.
      aug:
        au:
          Wang, Zhi-Cheng
          Wu, Xiao-Bei
        affil: College of Electronics and Information Engineering, Tongji University, Shanghai 201804, China.
      sug:
        subj:
          Ecosystem
          Models, Theoretical
          Mutation
      ab: Biogeography-based optimization (BBO) is a relatively new bioinspired heuristic for global optimization based on the mathematical models of biogeography. By investigating the applicability and performance of BBO for integer programming, we find that the original BBO algorithm does not perform well on a set of benchmark integer programming problems. Thus we modify the mutation operator and/or the neighborhood structure of the algorithm, resulting in three new BBO-based methods, named BlendBBO, BBO_DE, and LBBO_LDE, respectively. Computational experiments show that these methods are competitive approaches to solve integer programming problems, and the LBBO_LDE shows the best performance on the benchmark problems.
      pubtype: Academic Journal
      doctype: Journal Article
      ougenre: Article
    language: English
    refInfo:
    holdings:
      @attributes:
        islocal: N