• DocumentCode
    2362130
  • Title

    Hybrid Honey Bees Mating Optimisation algorithm to assign terminals to concentrators

  • Author

    Bernardino, Eugénia M. ; Bernardino, Anabela M. ; Sánchez-Pérez, Juan Manuel ; Pulido, Juan Antonio Gómez- ; Vega-Rodríguez, Miguel Angel

  • Author_Institution
    Dept. of Comput. Sci., Inst. of Leiria, Leiria, Portugal
  • fYear
    2010
  • fDate
    7-10 Nov. 2010
  • Firstpage
    1
  • Lastpage
    7
  • Abstract
    In this paper we propose a new approach to assign terminals to concentrators using a Hybrid Honey Bees Mating Optimisation algorithm. Honey Bees Mating Optimisation (HBMO) algorithm is a swarm-based optimisation algorithm, which simulates the mating process of real honey bees. We apply a hybridisation of HBMO to solve a combinatorial optimisation problem known as Terminal Assignment Problem (TAP). The purpose is to connect a given set of terminals to a given set of concentrators and minimise the link cost to form a communication network. The feasibility of Hybrid HBMO is demonstrated and compared with the solutions obtained by other algorithms from literature over different TAP instances.
  • Keywords
    line concentrators; particle swarm optimisation; concentrators; hybrid honey bees mating optimisation algorithm; hybridisation; swarm-based optimisation algorithm; terminal assignment problem; Communication Networks; Honey Bees Mating Optimisation Algorithm; Terminal Assignment Problem;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Applied Sciences in Biomedical and Communication Technologies (ISABEL), 2010 3rd International Symposium on
  • Conference_Location
    Rome
  • Print_ISBN
    978-1-4244-8131-6
  • Type

    conf

  • DOI
    10.1109/ISABEL.2010.5702845
  • Filename
    5702845