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

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 overal...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Packianather, M.S., Landy, M., Pham, D.T.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 794
container_issue
container_start_page 789
container_title
container_volume
creator Packianather, M.S.
Landy, M.
Pham, D.T.
description 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.
doi_str_mv 10.1109/INDIN.2009.5195903
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5195903</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5195903</ieee_id><sourcerecordid>5195903</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-aa55d36b73165e1f033990cff2ca72d9207433aa9c063ec7f53eb0cd3f646b823</originalsourceid><addsrcrecordid>eNotkMtOwzAURM1Loi39AdjkBxKuff2Il6UtUFGVDUjsKse5boKapIrTBX_Pq6vR0RzNYhi75ZBxDvZ-tVmsNpkAsJniVlnAMzbmUkiJRgM_ZyOBJk9R48cFm1qTnzplzSUbcYsqlcroazaO8RNAKS71iL0s28q1vm53yVBREg9EZdKFP3ggislsv-v6eqia5Bh_rUNFfdd0LaWFiz9uT74_1kND7XDDroLbR5qecsLeH5dv8-d0_fq0ms_Wac2NGlLnlCpRFwa5VsQDIFoLPgThnRGlFWAkonPWg0byJiikAnyJQUtd5AIn7O5_tyai7aGvG9d_bU-n4DeuKVHr</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Enhancing the speed of the Bees Algorithm using pheromone-based recruitment</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Packianather, M.S. ; Landy, M. ; Pham, D.T.</creator><creatorcontrib>Packianather, M.S. ; Landy, M. ; Pham, D.T.</creatorcontrib><description>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.</description><identifier>ISSN: 1935-4576</identifier><identifier>ISBN: 9781424437597</identifier><identifier>ISBN: 1424437598</identifier><identifier>EISSN: 2378-363X</identifier><identifier>EISBN: 1424437601</identifier><identifier>EISBN: 9781424437603</identifier><identifier>DOI: 10.1109/INDIN.2009.5195903</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bees Algorithm ; Biochemistry ; Chemicals ; Convergence ; Insects ; Intelligent Optimisation ; Iterative algorithms ; Pheromone ; Pulp manufacturing ; Recruitment ; Robustness ; Search methods</subject><ispartof>2009 7th IEEE International Conference on Industrial Informatics, 2009, p.789-794</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5195903$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5195903$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Packianather, M.S.</creatorcontrib><creatorcontrib>Landy, M.</creatorcontrib><creatorcontrib>Pham, D.T.</creatorcontrib><title>Enhancing the speed of the Bees Algorithm using pheromone-based recruitment</title><title>2009 7th IEEE International Conference on Industrial Informatics</title><addtitle>INDIN</addtitle><description>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.</description><subject>Bees Algorithm</subject><subject>Biochemistry</subject><subject>Chemicals</subject><subject>Convergence</subject><subject>Insects</subject><subject>Intelligent Optimisation</subject><subject>Iterative algorithms</subject><subject>Pheromone</subject><subject>Pulp manufacturing</subject><subject>Recruitment</subject><subject>Robustness</subject><subject>Search methods</subject><issn>1935-4576</issn><issn>2378-363X</issn><isbn>9781424437597</isbn><isbn>1424437598</isbn><isbn>1424437601</isbn><isbn>9781424437603</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkMtOwzAURM1Loi39AdjkBxKuff2Il6UtUFGVDUjsKse5boKapIrTBX_Pq6vR0RzNYhi75ZBxDvZ-tVmsNpkAsJniVlnAMzbmUkiJRgM_ZyOBJk9R48cFm1qTnzplzSUbcYsqlcroazaO8RNAKS71iL0s28q1vm53yVBREg9EZdKFP3ggislsv-v6eqia5Bh_rUNFfdd0LaWFiz9uT74_1kND7XDDroLbR5qecsLeH5dv8-d0_fq0ms_Wac2NGlLnlCpRFwa5VsQDIFoLPgThnRGlFWAkonPWg0byJiikAnyJQUtd5AIn7O5_tyai7aGvG9d_bU-n4DeuKVHr</recordid><startdate>200906</startdate><enddate>200906</enddate><creator>Packianather, M.S.</creator><creator>Landy, M.</creator><creator>Pham, D.T.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200906</creationdate><title>Enhancing the speed of the Bees Algorithm using pheromone-based recruitment</title><author>Packianather, M.S. ; Landy, M. ; Pham, D.T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-aa55d36b73165e1f033990cff2ca72d9207433aa9c063ec7f53eb0cd3f646b823</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Bees Algorithm</topic><topic>Biochemistry</topic><topic>Chemicals</topic><topic>Convergence</topic><topic>Insects</topic><topic>Intelligent Optimisation</topic><topic>Iterative algorithms</topic><topic>Pheromone</topic><topic>Pulp manufacturing</topic><topic>Recruitment</topic><topic>Robustness</topic><topic>Search methods</topic><toplevel>online_resources</toplevel><creatorcontrib>Packianather, M.S.</creatorcontrib><creatorcontrib>Landy, M.</creatorcontrib><creatorcontrib>Pham, D.T.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Packianather, M.S.</au><au>Landy, M.</au><au>Pham, D.T.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Enhancing the speed of the Bees Algorithm using pheromone-based recruitment</atitle><btitle>2009 7th IEEE International Conference on Industrial Informatics</btitle><stitle>INDIN</stitle><date>2009-06</date><risdate>2009</risdate><spage>789</spage><epage>794</epage><pages>789-794</pages><issn>1935-4576</issn><eissn>2378-363X</eissn><isbn>9781424437597</isbn><isbn>1424437598</isbn><eisbn>1424437601</eisbn><eisbn>9781424437603</eisbn><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.</abstract><pub>IEEE</pub><doi>10.1109/INDIN.2009.5195903</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1935-4576
ispartof 2009 7th IEEE International Conference on Industrial Informatics, 2009, p.789-794
issn 1935-4576
2378-363X
language eng
recordid cdi_ieee_primary_5195903
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Bees Algorithm
Biochemistry
Chemicals
Convergence
Insects
Intelligent Optimisation
Iterative algorithms
Pheromone
Pulp manufacturing
Recruitment
Robustness
Search methods
title Enhancing the speed of the Bees Algorithm using pheromone-based recruitment
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T04%3A27%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Enhancing%20the%20speed%20of%20the%20Bees%20Algorithm%20using%20pheromone-based%20recruitment&rft.btitle=2009%207th%20IEEE%20International%20Conference%20on%20Industrial%20Informatics&rft.au=Packianather,%20M.S.&rft.date=2009-06&rft.spage=789&rft.epage=794&rft.pages=789-794&rft.issn=1935-4576&rft.eissn=2378-363X&rft.isbn=9781424437597&rft.isbn_list=1424437598&rft_id=info:doi/10.1109/INDIN.2009.5195903&rft_dat=%3Cieee_6IE%3E5195903%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424437601&rft.eisbn_list=9781424437603&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5195903&rfr_iscdi=true