• DocumentCode
    2855946
  • Title

    Enhancing the speed of the Bees Algorithm using pheromone-based recruitment

  • Author

    Packianather, M.S. ; Landy, M. ; Pham, D.T.

  • Author_Institution
    Manuf. Eng. Centre, Cardiff Univ., Cardiff, UK
  • fYear
    2009
  • fDate
    23-26 June 2009
  • Firstpage
    789
  • Lastpage
    794
  • Abstract
    The bees algorithm is an intelligent optimisation tool mimicking the food foraging behaviour of honey bees. As a powerful search algorithm suitable for both continuous function and combinatorial optimisation it has gone through several modifications since its inception in order to improve its overall performance. This paper presents a new version of the bees algorithm which uses pheromone, a chemical substance secreted by bees and other insects into their environment, enabling them to communicate with other members of their own species. The new bees algorithm employs the pheromone to attract bees to explore the promising regions of the search space. Following a description of the algorithm, the paper presents the results obtained for a number of benchmark problems for functional optimization. Compared to the original bees algorithm, the new version showed an average improvement of 41% in convergence speed.
  • Keywords
    biomimetics; combinatorial mathematics; convergence; optimisation; search problems; bees algorithm; chemical substance; combinatorial optimisation; continuous function optimisation; convergence speed enhancement; food foraging behaviour; intelligent optimisation tool; pheromone-based recruitment; search algorithm; Biochemistry; Chemicals; Convergence; Insects; Iterative algorithms; Pulp manufacturing; Recruitment; Robustness; Search methods; Bees Algorithm; Intelligent Optimisation; Pheromone;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Industrial Informatics, 2009. INDIN 2009. 7th IEEE International Conference on
  • Conference_Location
    Cardiff, Wales
  • ISSN
    1935-4576
  • Print_ISBN
    978-1-4244-3759-7
  • Electronic_ISBN
    1935-4576
  • Type

    conf

  • DOI
    10.1109/INDIN.2009.5195903
  • Filename
    5195903