A directed artificial bee colony algorithm
•A new method based on artificial bee colony (ABC) algorithm is proposed in this study.•The improvement is based on direction information produced for artificial bees.•Performance of the proposed method has been examined on numeric functions.•The experimental results show that proposed approach is m...
Saved in:
| Published in | Applied soft computing Vol. 26; pp. 454 - 462 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
01.01.2015
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1568-4946 1872-9681 |
| DOI | 10.1016/j.asoc.2014.10.020 |
Cover
| Abstract | •A new method based on artificial bee colony (ABC) algorithm is proposed in this study.•The improvement is based on direction information produced for artificial bees.•Performance of the proposed method has been examined on numeric functions.•The experimental results show that proposed approach is more effective than some classical variants of ABC algorithm.
Artificial bee colony (ABC) algorithm has been introduced for solving numerical optimization problems, inspired collective behavior of honey bee colonies. ABC algorithm has three phases named as employed bee, onlooker bee and scout bee. In the model of ABC, only one design parameter of the optimization problem is updated by the artificial bees at the ABC phases by using interaction in the bees. This updating has caused the slow convergence to global or near global optimum for the algorithm. In order to accelerate convergence of the method, using a control parameter (modification rate-MR) has been proposed for ABC but this approach is based on updating more design parameters than one. In this study, we added directional information to ABC algorithms, instead of updating more design parameters than one. The performance of proposed approach was examined on well-known nine numerical benchmark functions and obtained results are compared with basic ABC and ABCs with MR. The experimental results show that the proposed approach is very effective method for solving numeric benchmark functions and successful in terms of solution quality, robustness and convergence to global optimum. |
|---|---|
| AbstractList | •A new method based on artificial bee colony (ABC) algorithm is proposed in this study.•The improvement is based on direction information produced for artificial bees.•Performance of the proposed method has been examined on numeric functions.•The experimental results show that proposed approach is more effective than some classical variants of ABC algorithm.
Artificial bee colony (ABC) algorithm has been introduced for solving numerical optimization problems, inspired collective behavior of honey bee colonies. ABC algorithm has three phases named as employed bee, onlooker bee and scout bee. In the model of ABC, only one design parameter of the optimization problem is updated by the artificial bees at the ABC phases by using interaction in the bees. This updating has caused the slow convergence to global or near global optimum for the algorithm. In order to accelerate convergence of the method, using a control parameter (modification rate-MR) has been proposed for ABC but this approach is based on updating more design parameters than one. In this study, we added directional information to ABC algorithms, instead of updating more design parameters than one. The performance of proposed approach was examined on well-known nine numerical benchmark functions and obtained results are compared with basic ABC and ABCs with MR. The experimental results show that the proposed approach is very effective method for solving numeric benchmark functions and successful in terms of solution quality, robustness and convergence to global optimum. |
| Author | Kıran, Mustafa Servet Fındık, Oğuz |
| Author_xml | – sequence: 1 givenname: Mustafa Servet orcidid: 0000-0002-5896-7180 surname: Kıran fullname: Kıran, Mustafa Servet email: mskiran@selcuk.edu.tr organization: Department of Computer Engineering, Faculty of Engineering, University of Selcuk, 42075 Konya, Turkey – sequence: 2 givenname: Oğuz surname: Fındık fullname: Fındık, Oğuz organization: Department of Computer Engineering, Faculty of Engineering and Architecture, Abant İzzet Baysal University, 14280 Bolu, Turkey |
| BookMark | eNp9kMtqwzAQRUVJoUnaH-jK64LdkayXoZsQ-oJAN-1ayPK4VXCsIolC_r426aqLrGa4cIY5d0UWYxiRkFsKFQUq7_eVTcFVDCifggoYXJAl1YqVjdR0Me1C6pI3XF6RVUp7mKCG6SW52xSdj-gydoWN2ffeeTsULWLhwhDGY2GHzxB9_jpck8veDglv_uaafDw9vm9fyt3b8-t2sytdDZBLLTig1L1tG-jbhinWQU9FraxUrauFVIIyyVvFgUmhLGdglWA1Th8Jq7FeE32662JIKWJvnM82-zDmaP1gKJjZ2ezN7Gxm5zmbnCeU_UO_oz_YeDwPPZwgnKR-PEaTnMfR4akY0wV_Dv8Fz_ZwQw |
| CitedBy_id | crossref_primary_10_1016_j_asoc_2020_106339 crossref_primary_10_1016_j_ijleo_2016_09_085 crossref_primary_10_1016_j_engappai_2022_105311 crossref_primary_10_1016_j_cie_2017_10_022 crossref_primary_10_1016_j_swevo_2019_06_006 crossref_primary_10_1109_TCYB_2020_3026716 crossref_primary_10_1007_s11071_016_3128_z crossref_primary_10_32604_cmes_2024_052001 crossref_primary_10_3390_pr7120909 crossref_primary_10_1016_j_knosys_2023_110939 crossref_primary_10_1016_j_asoc_2018_10_024 crossref_primary_10_1007_s11831_025_10269_w crossref_primary_10_1016_j_chb_2018_08_038 crossref_primary_10_1186_s13638_020_1659_y crossref_primary_10_31590_ejosat_1010813 crossref_primary_10_1007_s11047_020_09808_0 crossref_primary_10_1080_09720529_2017_1359379 crossref_primary_10_1016_j_asoc_2017_05_005 crossref_primary_10_1016_j_ins_2018_06_032 crossref_primary_10_3390_sym16070795 crossref_primary_10_1109_TFUZZ_2018_2856120 crossref_primary_10_1007_s00500_017_2485_y crossref_primary_10_1016_j_future_2018_06_054 crossref_primary_10_1155_2019_2564754 crossref_primary_10_46810_tdfd_1123962 crossref_primary_10_1007_s11227_025_06938_z crossref_primary_10_1007_s13042_020_01094_7 crossref_primary_10_3390_sym13030419 crossref_primary_10_1007_s00521_022_06981_4 crossref_primary_10_1007_s00500_021_06062_z crossref_primary_10_1016_j_ins_2017_07_011 crossref_primary_10_3233_HIS_160229 crossref_primary_10_1007_s11042_019_7211_6 crossref_primary_10_4316_AECE_2017_03007 crossref_primary_10_1007_s10489_016_0815_x crossref_primary_10_31795_baunsobed_1545006 crossref_primary_10_1155_2015_739437 crossref_primary_10_1007_s13198_017_0684_7 crossref_primary_10_1007_s00500_016_2166_2 crossref_primary_10_1016_j_trip_2020_100233 crossref_primary_10_1016_j_neucom_2016_08_003 crossref_primary_10_1016_j_ins_2017_11_007 crossref_primary_10_1016_j_ins_2019_07_022 crossref_primary_10_7232_iems_2016_15_4_324 crossref_primary_10_4316_AECE_2017_03011 crossref_primary_10_1016_j_eswa_2019_112921 crossref_primary_10_1016_j_ins_2014_12_043 crossref_primary_10_3390_a10030082 crossref_primary_10_1016_j_jksuci_2016_03_001 crossref_primary_10_1080_0305215X_2017_1361416 crossref_primary_10_1016_j_eswa_2022_116625 crossref_primary_10_1155_2022_4865716 crossref_primary_10_3390_a10030085 crossref_primary_10_1007_s00500_019_03964_x crossref_primary_10_1016_j_eswa_2024_125495 crossref_primary_10_4316_AECE_2017_03012 crossref_primary_10_1155_2021_6672579 crossref_primary_10_1016_j_asoc_2017_06_015 crossref_primary_10_1016_j_knosys_2022_108306 crossref_primary_10_3390_axioms11100523 crossref_primary_10_1007_s00521_019_04155_3 crossref_primary_10_1016_j_asoc_2018_06_034 crossref_primary_10_1007_s11071_019_05358_y crossref_primary_10_1109_TII_2018_2857198 crossref_primary_10_1007_s11227_019_03127_7 crossref_primary_10_1016_j_asoc_2017_02_030 crossref_primary_10_1080_1206212X_2019_1660835 crossref_primary_10_1007_s13198_016_0495_2 crossref_primary_10_1109_ACCESS_2019_2905666 crossref_primary_10_1007_s40747_022_00746_1 crossref_primary_10_1016_j_jmmm_2020_166724 crossref_primary_10_1080_01969722_2023_2175147 crossref_primary_10_1109_ACCESS_2021_3050752 crossref_primary_10_1016_j_asoc_2015_12_044 crossref_primary_10_1016_j_energy_2018_10_104 crossref_primary_10_1109_TSMC_2018_2876235 crossref_primary_10_1007_s00500_017_2689_1 crossref_primary_10_1016_j_asoc_2020_106656 crossref_primary_10_1007_s41870_023_01613_z crossref_primary_10_4018_IJSIR_352061 crossref_primary_10_1016_j_engappai_2022_104783 crossref_primary_10_1007_s11277_018_6017_6 crossref_primary_10_1007_s13369_018_3064_y crossref_primary_10_1109_TSMC_2022_3219380 crossref_primary_10_1155_2021_6455592 crossref_primary_10_1016_j_knosys_2019_105002 crossref_primary_10_1016_j_asoc_2017_06_008 crossref_primary_10_1007_s40747_020_00171_2 crossref_primary_10_1109_JAS_2021_1004129 crossref_primary_10_1007_s11235_024_01225_3 crossref_primary_10_3390_en10070898 crossref_primary_10_1016_j_trd_2018_04_025 crossref_primary_10_1007_s00521_019_04533_x crossref_primary_10_1016_j_simpat_2018_06_004 crossref_primary_10_26636_jtit_2016_2_718 crossref_primary_10_1016_j_asoc_2015_05_041 crossref_primary_10_1016_j_swevo_2018_05_002 crossref_primary_10_1155_2016_9820294 crossref_primary_10_3390_electronics13245061 crossref_primary_10_1016_j_asoc_2021_107476 crossref_primary_10_1016_j_neucom_2019_04_086 crossref_primary_10_1016_j_swevo_2019_100582 crossref_primary_10_1007_s00500_018_3473_6 crossref_primary_10_3390_sym9080159 crossref_primary_10_1016_j_advengsoft_2019_102685 crossref_primary_10_1007_s13369_020_04875_y crossref_primary_10_1016_j_amc_2015_07_030 crossref_primary_10_1016_j_compbiomed_2022_105857 crossref_primary_10_31796_ogummf_878991 crossref_primary_10_1155_2021_7902783 crossref_primary_10_1007_s00500_018_3188_8 crossref_primary_10_3233_JCM_170724 crossref_primary_10_1007_s00371_020_01978_3 crossref_primary_10_1002_dac_4166 crossref_primary_10_1016_j_asoc_2021_107246 crossref_primary_10_1007_s13198_016_0545_9 crossref_primary_10_1080_01969722_2022_2097981 crossref_primary_10_1007_s40684_018_0057_y crossref_primary_10_1016_j_swevo_2019_100631 crossref_primary_10_1016_j_asoc_2016_12_017 crossref_primary_10_1016_j_asoc_2017_11_012 crossref_primary_10_1007_s10489_020_01711_6 crossref_primary_10_1088_1757_899X_518_5_052014 crossref_primary_10_1007_s00521_016_2687_8 crossref_primary_10_1007_s11277_021_08531_y crossref_primary_10_1007_s42107_020_00299_z crossref_primary_10_1016_j_ins_2016_07_022 crossref_primary_10_1016_j_asoc_2017_10_040 crossref_primary_10_7498_aps_68_20182080 crossref_primary_10_1016_j_knosys_2017_11_029 crossref_primary_10_1016_j_swevo_2019_01_003 crossref_primary_10_1007_s12065_019_00292_9 crossref_primary_10_1007_s10489_021_02711_w crossref_primary_10_1016_j_asoc_2016_08_023 crossref_primary_10_1007_s00521_016_2348_y crossref_primary_10_1016_j_rineng_2024_103125 crossref_primary_10_3390_sym11080995 crossref_primary_10_1016_j_ins_2017_05_044 crossref_primary_10_1371_journal_pone_0274625 crossref_primary_10_1016_j_compeleceng_2019_06_021 crossref_primary_10_1016_j_amc_2020_125535 crossref_primary_10_1016_j_asoc_2019_105982 crossref_primary_10_1016_j_asoc_2019_106037 crossref_primary_10_1016_j_eswa_2022_116930 crossref_primary_10_1155_2016_9791060 crossref_primary_10_1109_ACCESS_2021_3129830 crossref_primary_10_1007_s00500_019_03785_y crossref_primary_10_1007_s00500_016_2418_1 crossref_primary_10_1007_s12065_020_00364_1 |
| Cites_doi | 10.1016/j.asoc.2007.05.007 10.1007/s10898-007-9149-x 10.1016/j.eswa.2010.02.042 10.1016/j.cam.2012.01.013 10.1016/j.asoc.2010.11.025 10.1109/JSEE.2012.00034 10.1016/j.cor.2011.06.007 10.1016/j.ins.2011.04.024 10.1016/j.asoc.2009.12.008 10.1613/jair.1660 10.1016/j.ins.2010.07.015 10.1016/j.amc.2009.03.090 10.1016/j.amc.2010.08.049 10.1016/j.asoc.2010.12.001 |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier B.V. |
| Copyright_xml | – notice: 2014 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.asoc.2014.10.020 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-9681 |
| EndPage | 462 |
| ExternalDocumentID | 10_1016_j_asoc_2014_10_020 S1568494614005304 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 23M 4.4 457 4G. 53G 5GY 5VS 6J9 7-5 71M 8P~ AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W JJJVA KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SES SEW SPC SPCBC SST SSV SSZ T5K UHS UNMZH ~G- AATTM AAXKI AAYWO AAYXX ABWVN ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AFXIZ AGCQF AGQPQ AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP BNPGV CITATION SSH |
| ID | FETCH-LOGICAL-c300t-8540e68fab90fb9272d0f1537a67bc356751264b7402657a420a7523e1695a8e3 |
| IEDL.DBID | AIKHN |
| ISSN | 1568-4946 |
| IngestDate | Thu Apr 24 22:56:40 EDT 2025 Tue Jul 01 01:49:52 EDT 2025 Fri Feb 23 02:27:59 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Direction information Swarm intelligence Artificial bee colony Numerical optimization |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c300t-8540e68fab90fb9272d0f1537a67bc356751264b7402657a420a7523e1695a8e3 |
| ORCID | 0000-0002-5896-7180 |
| PageCount | 9 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_asoc_2014_10_020 crossref_primary_10_1016_j_asoc_2014_10_020 elsevier_sciencedirect_doi_10_1016_j_asoc_2014_10_020 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | January 2015 2015-01-00 |
| PublicationDateYYYYMMDD | 2015-01-01 |
| PublicationDate_xml | – month: 01 year: 2015 text: January 2015 |
| PublicationDecade | 2010 |
| PublicationTitle | Applied soft computing |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Liu, Ling, Liu (bib0110) 2012; 23 Gao, Liu (bib0120) 2012; 39 Karaboga, Gorkemli, Ozturk, Karaboga (bib0030) 2012 Kang, Lie, Ma (bib0085) 2011; 181 Tsai, Pan, Liao, Chu (bib0060) 2009; 5 Kennedy, Eberhart (bib0010) 1995 Dorigo, Maniezzo, Colorni (bib0005) 1991 Gao, Liu (bib0075) 2012; 39 Gao, Liu, Huang (bib0125) 2012 Karaboga, Basturk (bib0035) 2007; 39 Karaboga, Akay (bib0045) 2009; 214 Akay, Karaboga (bib0135) 2009 Barnharnsakun, Achalakul, Sirinaovakul (bib0080) 2011; 11 Karaboga, Akay (bib0050) 2009 Alatas (bib0065) 2010; 37 Zhu, Kwong (bib0070) 2010; 217 Kıran, Gündüz (bib0095) 2012; 9 Horng (bib0100) 2011; 38 Omkar, Senthilnath, Khandelwal, Naik, Gopalakrishman (bib0105) 2011; 11 Karaboga, Basturk (bib0040) 2008; 8 Dongli, Xinping, Yinggan, Yong (bib0055) 2011 Karaboga (bib0015) 2005 Boyer, Martinez, Pedrajas (bib0130) 2005; 24 Gao, Liu, Huang (bib0115) 2012; 236 Akay, Karaboga (bib0025) 2012; 192 Karaboga, Akay (bib0090) 2011; 11 Seeley (bib0020) 1995 Karaboga (10.1016/j.asoc.2014.10.020_bib0030) 2012 Barnharnsakun (10.1016/j.asoc.2014.10.020_bib0080) 2011; 11 Gao (10.1016/j.asoc.2014.10.020_bib0075) 2012; 39 Karaboga (10.1016/j.asoc.2014.10.020_bib0040) 2008; 8 Kıran (10.1016/j.asoc.2014.10.020_bib0095) 2012; 9 Omkar (10.1016/j.asoc.2014.10.020_bib0105) 2011; 11 Gao (10.1016/j.asoc.2014.10.020_bib0120) 2012; 39 Karaboga (10.1016/j.asoc.2014.10.020_bib0090) 2011; 11 Tsai (10.1016/j.asoc.2014.10.020_bib0060) 2009; 5 Alatas (10.1016/j.asoc.2014.10.020_bib0065) 2010; 37 Dorigo (10.1016/j.asoc.2014.10.020_bib0005) 1991 Kang (10.1016/j.asoc.2014.10.020_bib0085) 2011; 181 Zhu (10.1016/j.asoc.2014.10.020_bib0070) 2010; 217 Liu (10.1016/j.asoc.2014.10.020_bib0110) 2012; 23 Gao (10.1016/j.asoc.2014.10.020_bib0125) 2012 Gao (10.1016/j.asoc.2014.10.020_bib0115) 2012; 236 Karaboga (10.1016/j.asoc.2014.10.020_bib0050) 2009 Horng (10.1016/j.asoc.2014.10.020_bib0100) 2011; 38 Dongli (10.1016/j.asoc.2014.10.020_bib0055) 2011 Karaboga (10.1016/j.asoc.2014.10.020_bib0045) 2009; 214 Akay (10.1016/j.asoc.2014.10.020_bib0135) 2009 Seeley (10.1016/j.asoc.2014.10.020_bib0020) 1995 Kennedy (10.1016/j.asoc.2014.10.020_bib0010) 1995 Karaboga (10.1016/j.asoc.2014.10.020_bib0015) 2005 Karaboga (10.1016/j.asoc.2014.10.020_bib0035) 2007; 39 Akay (10.1016/j.asoc.2014.10.020_bib0025) 2012; 192 Boyer (10.1016/j.asoc.2014.10.020_bib0130) 2005; 24 |
| References_xml | – volume: 8 start-page: 687 year: 2008 end-page: 697 ident: bib0040 article-title: On the performance of artificial bee colony (abc) algorithm publication-title: Appl. Soft Comput. – volume: 11 start-page: 3021 year: 2011 end-page: 3031 ident: bib0090 article-title: A modified artificial bee colony (ABC) algorithm for constrained optimization problems publication-title: Appl. Soft Comput. – year: 1991 ident: bib0005 article-title: Positive Feedback as a Search Strategy, Technical Report No. 91-016 – volume: 192 start-page: 120 year: 2012 end-page: 142 ident: bib0025 article-title: A modified artificial bee colony algorithm for real-parameter optimization publication-title: Inf. Sci. – year: 2009 ident: bib0050 article-title: Artificial bee colony (abc), harmony search and bees algorithms on numerical optimization publication-title: 2009 Innovative Production Machines and Systems Virtual Conference – year: 2012 ident: bib0030 article-title: A comprehensive survey: artificial bee colony (ABC) algorithm and applications publication-title: Artif. Intell. Rev. – year: 2005 ident: bib0015 article-title: An Idea Based on Honey Bee Swarm for Numerical Optimization, Technical Report – TR06 – volume: 39 start-page: 687 year: 2012 end-page: 697 ident: bib0075 article-title: A modified artificial bee colony algorithm publication-title: Comput. Oper. Res. – start-page: 1942 year: 1995 end-page: 1948 ident: bib0010 article-title: Particle swarm optimization publication-title: Proc. of IEEE International Conference on Neural Networks – volume: 9 start-page: 6107 year: 2012 end-page: 6121 ident: bib0095 article-title: A novel artificial bee colony-based algorithm for solving the numerical optimization problems publication-title: Int. J. Innov. Comput. Inf. Control – volume: 38 start-page: 13785 year: 2011 end-page: 13791 ident: bib0100 article-title: Multilevel thresholding selection based on the artificial bee colony algorithm for image segmentation publication-title: Expert Syst. Appl. – volume: 181 start-page: 3508 year: 2011 end-page: 3531 ident: bib0085 article-title: Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions publication-title: Inf. Sci. – year: 1995 ident: bib0020 article-title: The Wisdom of the Hive – volume: 214 start-page: 108 year: 2009 end-page: 132 ident: bib0045 article-title: A comparative study of artificial bee colony algorithm publication-title: Appl. Math. Comput. – volume: 236 start-page: 2741 year: 2012 end-page: 2753 ident: bib0115 article-title: A global best artificial bee colony algorithm for global optimization publication-title: J. Comput. Appl. Math. – volume: 23 start-page: 265 year: 2012 end-page: 275 ident: bib0110 article-title: Improved artificial bee colony algorithm with mutual learning publication-title: J. Syst. Eng. Electron. – volume: 39 start-page: 687 year: 2012 end-page: 697 ident: bib0120 article-title: A modified artificial bee colony algorithm publication-title: Comput. Oper. Res. – start-page: 608 year: 2009 end-page: 619 ident: bib0135 article-title: Parameter tuning for the artificial bee colony algorithm publication-title: Proc. of the 1st International Conference on Computational Collective Intelligence – year: 2012 ident: bib0125 article-title: A novel artificial bee colony algorithm based on modified search equation and orthogonal learning publication-title: IEEE Trans. Syst. Man Cybern. B – volume: 11 start-page: 2888 year: 2011 end-page: 2901 ident: bib0080 article-title: The best-so-far selection in artificial bee colony algorithm publication-title: Appl. Soft Comput. – volume: 217 start-page: 3166 year: 2010 end-page: 3173 ident: bib0070 article-title: Gbest-guided artificial bee colony algorithm for numerical function optimization publication-title: Appl. Math. Comput. – volume: 39 start-page: 459 year: 2007 end-page: 471 ident: bib0035 article-title: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm publication-title: J. Glob. Optim. – volume: 24 start-page: 1 year: 2005 end-page: 48 ident: bib0130 article-title: Crossover operator for evolutionary algorithms based on population features publication-title: J. Artif. Intell. Res. – volume: 5 start-page: 5081 year: 2009 end-page: 5092 ident: bib0060 article-title: Enhanced artificial bee colony optimization publication-title: Int. J. Innov. Comput. Inf. Control – volume: 11 start-page: 489 year: 2011 end-page: 499 ident: bib0105 article-title: Artificial bee colony (ABC) for multi-objective design optimization of composite structures publication-title: Appl. Soft Comput. – start-page: 1 year: 2011 end-page: 4 ident: bib0055 article-title: Modified artificial bee colony algorithms for numerical optimization publication-title: Proc. of 3rd International Workshop on Intelligent Systems and Applications – volume: 37 start-page: 5682 year: 2010 end-page: 5687 ident: bib0065 article-title: Chaotic bee colony algorithms for global numerical optimization publication-title: Expert Syst. Appl. – start-page: 1 year: 2011 ident: 10.1016/j.asoc.2014.10.020_bib0055 article-title: Modified artificial bee colony algorithms for numerical optimization – volume: 8 start-page: 687 year: 2008 ident: 10.1016/j.asoc.2014.10.020_bib0040 article-title: On the performance of artificial bee colony (abc) algorithm publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2007.05.007 – volume: 38 start-page: 13785 year: 2011 ident: 10.1016/j.asoc.2014.10.020_bib0100 article-title: Multilevel thresholding selection based on the artificial bee colony algorithm for image segmentation publication-title: Expert Syst. Appl. – year: 2012 ident: 10.1016/j.asoc.2014.10.020_bib0030 article-title: A comprehensive survey: artificial bee colony (ABC) algorithm and applications publication-title: Artif. Intell. Rev. – volume: 39 start-page: 459 year: 2007 ident: 10.1016/j.asoc.2014.10.020_bib0035 article-title: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm publication-title: J. Glob. Optim. doi: 10.1007/s10898-007-9149-x – volume: 37 start-page: 5682 year: 2010 ident: 10.1016/j.asoc.2014.10.020_bib0065 article-title: Chaotic bee colony algorithms for global numerical optimization publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2010.02.042 – volume: 236 start-page: 2741 year: 2012 ident: 10.1016/j.asoc.2014.10.020_bib0115 article-title: A global best artificial bee colony algorithm for global optimization publication-title: J. Comput. Appl. Math. doi: 10.1016/j.cam.2012.01.013 – volume: 11 start-page: 2888 year: 2011 ident: 10.1016/j.asoc.2014.10.020_bib0080 article-title: The best-so-far selection in artificial bee colony algorithm publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2010.11.025 – volume: 23 start-page: 265 year: 2012 ident: 10.1016/j.asoc.2014.10.020_bib0110 article-title: Improved artificial bee colony algorithm with mutual learning publication-title: J. Syst. Eng. Electron. doi: 10.1109/JSEE.2012.00034 – volume: 39 start-page: 687 year: 2012 ident: 10.1016/j.asoc.2014.10.020_bib0120 article-title: A modified artificial bee colony algorithm publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.06.007 – volume: 181 start-page: 3508 year: 2011 ident: 10.1016/j.asoc.2014.10.020_bib0085 article-title: Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions publication-title: Inf. Sci. doi: 10.1016/j.ins.2011.04.024 – year: 2009 ident: 10.1016/j.asoc.2014.10.020_bib0050 article-title: Artificial bee colony (abc), harmony search and bees algorithms on numerical optimization – volume: 11 start-page: 489 year: 2011 ident: 10.1016/j.asoc.2014.10.020_bib0105 article-title: Artificial bee colony (ABC) for multi-objective design optimization of composite structures publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2009.12.008 – volume: 24 start-page: 1 year: 2005 ident: 10.1016/j.asoc.2014.10.020_bib0130 article-title: Crossover operator for evolutionary algorithms based on population features publication-title: J. Artif. Intell. Res. doi: 10.1613/jair.1660 – start-page: 608 year: 2009 ident: 10.1016/j.asoc.2014.10.020_bib0135 article-title: Parameter tuning for the artificial bee colony algorithm – year: 1995 ident: 10.1016/j.asoc.2014.10.020_bib0020 – volume: 192 start-page: 120 year: 2012 ident: 10.1016/j.asoc.2014.10.020_bib0025 article-title: A modified artificial bee colony algorithm for real-parameter optimization publication-title: Inf. Sci. doi: 10.1016/j.ins.2010.07.015 – year: 2005 ident: 10.1016/j.asoc.2014.10.020_bib0015 – volume: 214 start-page: 108 year: 2009 ident: 10.1016/j.asoc.2014.10.020_bib0045 article-title: A comparative study of artificial bee colony algorithm publication-title: Appl. Math. Comput. doi: 10.1016/j.amc.2009.03.090 – volume: 5 start-page: 5081 year: 2009 ident: 10.1016/j.asoc.2014.10.020_bib0060 article-title: Enhanced artificial bee colony optimization publication-title: Int. J. Innov. Comput. Inf. Control – volume: 217 start-page: 3166 year: 2010 ident: 10.1016/j.asoc.2014.10.020_bib0070 article-title: Gbest-guided artificial bee colony algorithm for numerical function optimization publication-title: Appl. Math. Comput. doi: 10.1016/j.amc.2010.08.049 – volume: 11 start-page: 3021 year: 2011 ident: 10.1016/j.asoc.2014.10.020_bib0090 article-title: A modified artificial bee colony (ABC) algorithm for constrained optimization problems publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2010.12.001 – volume: 9 start-page: 6107 year: 2012 ident: 10.1016/j.asoc.2014.10.020_bib0095 article-title: A novel artificial bee colony-based algorithm for solving the numerical optimization problems publication-title: Int. J. Innov. Comput. Inf. Control – year: 2012 ident: 10.1016/j.asoc.2014.10.020_bib0125 article-title: A novel artificial bee colony algorithm based on modified search equation and orthogonal learning publication-title: IEEE Trans. Syst. Man Cybern. B – year: 1991 ident: 10.1016/j.asoc.2014.10.020_bib0005 – start-page: 1942 year: 1995 ident: 10.1016/j.asoc.2014.10.020_bib0010 article-title: Particle swarm optimization – volume: 39 start-page: 687 year: 2012 ident: 10.1016/j.asoc.2014.10.020_bib0075 article-title: A modified artificial bee colony algorithm publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.06.007 |
| SSID | ssj0016928 |
| Score | 2.5005915 |
| Snippet | •A new method based on artificial bee colony (ABC) algorithm is proposed in this study.•The improvement is based on direction information produced for... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 454 |
| SubjectTerms | Artificial bee colony Direction information Numerical optimization Swarm intelligence |
| Title | A directed artificial bee colony algorithm |
| URI | https://dx.doi.org/10.1016/j.asoc.2014.10.020 |
| Volume | 26 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELZKu7DwRpRH5YEJ5DZN_IjHqgKVhyoEVOoW2Y4DRSWtqjCw8Ns5N04FEurAGMsn-b5c7j7H5zuEzqmBuMGMJFmQakKVCYgWxhJGqWUmioNML6t9DvlgRG_HbFxD_eoujEur9L6_9OlLb-1HOh7Nznwy6TzBziOmkkJ8cZbkaoI2wkhyVkeN3s3dYLg6TOBy2WLVzSdOwN-dKdO8FIDgMrxo2yV5ubbff8WnHzHnegdtebKIe-V6dlHN5ntou2rEgP13uY8uerhUw6bYLb6sCoG1tdgVpc4_sZq-zBaT4vX9AI2ur577A-KbIBATBUFBYqBUlseZ0hJwk6EI0yADNyUUF9pEDAh_F0iNFrAR5EwoGgZKwO7SgtpMxTY6RPV8ltsjhHkaURtnEpgqo5ZqzWMrUqllGnYpEIMm6laqJ8ZXCHeNKqZJlQr2lji4EgeXGwO4muhyJTMv62Osnc0qRJNfbzkBB75G7vifcidoE55Y-cvkFNWLxYc9AxJR6BbaaH91W2Aq_cf7h5Y3mW9SV8S3 |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELaqMsDCG1GeHphAbvOw43isKqoCpQut1C2yHQeKSlpVYWDht3NOnAokxMDqnCX7i3P3XfT5DqErqiFuMC1I5qWKUKk9org2hFFqmA5jL1Nltc9RNJjQ-ymbNlCvvgtjZZXO91c-vfTWbqTj0OwsZ7POE2QeMRUU4os9SbYm6AZlIbe6vvbnWufhR6JssGqtiTV3N2cqkZcECKy-i7atxMs2_f4tOn2LOP1dtO2oIu5Wq9lDDZPvo526DQN2X-UBuu7iahMmxXbpVU0IrIzBtiR1_oHl_HmxmhUvb4do0r8d9wbEtUAgOvS8gsRAqEwUZ1IJQE0EPEi9DJwUlxFXOmRA932gNIpDGhgxLmngSQ65pYFtMxmb8Ag180VujhGO0pCaOBPAUxk1VKkoNjwVSqSBT4EWtJBfbz3Rrj64bVMxT2oh2Gti4UosXHYM4Gqhm_WcZVUd409rViOa_HjHCbjvP-ad_HPeJdocjB-HyfBu9HCKtuAJq36enKFmsXo350AnCnVRHpcvzV_D7Q |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+directed+artificial+bee+colony+algorithm&rft.jtitle=Applied+soft+computing&rft.au=K%C4%B1ran%2C+Mustafa+Servet&rft.au=F%C4%B1nd%C4%B1k%2C+O%C4%9Fuz&rft.date=2015-01-01&rft.pub=Elsevier+B.V&rft.issn=1568-4946&rft.eissn=1872-9681&rft.volume=26&rft.spage=454&rft.epage=462&rft_id=info:doi/10.1016%2Fj.asoc.2014.10.020&rft.externalDocID=S1568494614005304 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1568-4946&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1568-4946&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1568-4946&client=summon |