Skip to main content

Enhancing Artificial Bee Colony Algorithm with Superior Information Learning

  • Conference paper
  • First Online:
PRICAI 2018: Trends in Artificial Intelligence (PRICAI 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11012))

Included in the following conference series:

  • 3226 Accesses

Abstract

Artificial bee colony (ABC) algorithm has attracted much attention for its good performance and simple structure in recent years. However, its solution search equation does well in exploration but badly in exploitation, which may result in slow convergence rate for complex optimization problems. To address this defect, many ABC variants have been developed based on utilizing the global best individual or the group of elite individuals. Although the utilization of such good individuals is indeed beneficial to enhance the exploitation, it may also run the risk of causing the algorithm too greedy. In this paper, we proposed a modified ABC algorithm with superior information learning (SIL) strategy for achieving a better balance between the exploration and exploitation abilities. In the proposed SIL strategy, the individuals are expected to learn superior information from an exemplar which has better fitness value than the individuals themselves. The exemplar is no longer acted by the global best individual or the elite group. The proposed SIL strategy is designed to utilize the valuable information of good individuals while without losing the diversity. In the experiments, 22 well-known test functions and six state-of-the-art ABC variants are used. The comparison results showed that our approach significantly accelerate the convergence rate, and has better or at least comparable performance than the competitors on most of the test functions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Erciyes University, Kayseri (2005)

    Google Scholar 

  2. Zhu, G., Kwong, S.: Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl. Math. Comput. 217(7), 3166–3173 (2010)

    MathSciNet  MATH  Google Scholar 

  3. Gao, W., Liu, S.: A modified artificial bee colony algorithm. Comput. Oper. Res. 39(3), 687–697 (2012)

    Article  Google Scholar 

  4. Zhou, X., Wang, H., Wang, M., Wan, J.: Enhancing the modified artificial bee colony algorithm with neighborhood search. Soft. Comput. 21(10), 2733–2743 (2017)

    Article  Google Scholar 

  5. Yu, W., Zhan, Z., Zhang, J.: Artificial bee colony algorithm with an adaptive greedy position update strategy. Soft. Comput. 22(2), 437–451 (2018)

    Article  Google Scholar 

  6. Cui, L., et al.: A novel artificial bee colony algorithm with depth-first search framework and elite-guided search equation. Inf. Sci. 367–368, 1012–1044 (2016)

    Article  Google Scholar 

  7. Kong, D., Chang, T., Dai, W., Wang, Q., Sun, H.: An improved artificial bee colony algorithm based on elite group guidance and combined breadth-depth search strategy. Inf. Sci. 442–443, 54–71 (2018)

    Article  MathSciNet  Google Scholar 

  8. Das, S., Abraham, A., Chakraborty, U.K., Konar, A.: Differential evolution using a neighborhood-based mutation operator. IEEE Trans. Evol. Comput. 13(3), 526–553 (2009)

    Article  Google Scholar 

  9. Gao, W., Chan, F.T.S., Huang, L., Liu, S.: Bare bones artificial bee colony algorithm with parameter adaptation and fitness-based neighborhood. Inf. Sci. 316, 180–200 (2015)

    Article  Google Scholar 

  10. Wang, H., Sun, H., Li, C., Rahnamayan, S., Pan, J.: Diversity enhanced particle swarm optimization with neighborhood search. Inf. Sci. 223(2), 119–135 (2013)

    Article  MathSciNet  Google Scholar 

  11. Meng, A., Chen, Y., Yin, H., Chen, S.: Crisscross optimization algorithm and its application. Knowl.-Based Syst. 67, 218–229 (2014)

    Article  Google Scholar 

  12. Yu, X., Liu, Y., Feng, X., Chen, G.: Enhanced comprehensive learning particle swarm optimization with exemplar evolution. In: Shi, Y., et al. (eds.) SEAL 2017. LNCS, vol. 10593, pp. 929–938. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68759-9_76

    Chapter  Google Scholar 

  13. Wang, H., Wu, Z., Rahnamayan, S., Sun, H., Liu, Y., Pan, J.: Multi-strategy ensemble artificial bee colony algorithm. Inf. Sci. 279(9), 587–603 (2014)

    Article  MathSciNet  Google Scholar 

  14. Xiang, W.L., Meng, X.L., Li, Y.Z., He, R.C., An, M.Q.: An improved artificial bee colony algorithm based on the gravity model. Inf. Sci. 429, 49–71 (2018)

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported by the National Natural Science Foundation of China (Nos. 61603163, 61462045 and 61562042) and the Science and Technology Foundation of Jiangxi Province (No. 20151BAB217007).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xinyu Zhou .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhou, X., Liu, Y., Wang, M., Wan, J. (2018). Enhancing Artificial Bee Colony Algorithm with Superior Information Learning. In: Geng, X., Kang, BH. (eds) PRICAI 2018: Trends in Artificial Intelligence. PRICAI 2018. Lecture Notes in Computer Science(), vol 11012. Springer, Cham. https://doi.org/10.1007/978-3-319-97304-3_71

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-97304-3_71

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-97303-6

  • Online ISBN: 978-3-319-97304-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics