Skip to main content
SpringerLink
Log in

An Artificial Bee Colony Algorithm with History-Driven Scout Bees Phase

  • Conference paper
  • First Online:
Advances in Swarm and Computational Intelligence (ICSI 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9140))

Included in the following conference series:

Abstract

The scout bees phase of artificial bee colony (ABC) algorithm emulates a random restart and cannot make sure the quality of the solution generated. Thus, we propose to use the entire search history to improve the quality of regenerated solutions, called history-driven scout bee ABC (HdABC). The proposed algorithm has been tested on a set of 28 test functions. Experimental results show that ABC cannot significantly outperforms HdABC on all functions; while HdABC significantly outperforms ABC in most test cases. Moreover, when the number of restarts increases, the performance of HdABC improves.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithms. Journal of Global Optimization. 39, 459–471 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  2. Diwold, K., Aderhold, A., Scheidler, A., Middendorf, M.: Performance evaluation of artificial bee colony optimization and new selection schemes. Memetic Computing. 3, 149–162 (2011)

    Article  Google Scholar 

  3. Zhang, X., Zhang, X., Ho, S.L., Fu, W.N.: A modification of artificial bee colony algorithm applied to loudspeaker design problem. IEEE Transactions on Magnetics. 50, 737–740 (2014)

    Article  Google Scholar 

  4. Zhu, G., Kwong, S.: Gbest-guided artificial bee colony algorithm for numerical function optimization. Applied Mathematics and Computation. 217, 3166–3173 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kang, F., Li, J., Ma, Z.: Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical function. Information Sciences. 181, 3509–3531 (2011)

    Article  MathSciNet  Google Scholar 

  6. Zhang, X., Zhang, X., Yuen, S.Y., Ho, S.L., Fu, W.N.: An improved artificial bee colony algorithm for optimal design of electromagnetic devices. IEEE Transactions on Magnetics. 49, 4811–4816 (2013)

    Article  Google Scholar 

  7. Karaboga, D., Gorkemli, B.: A quick artificial bee colony (qABC) algorithm and its performance on optimization problems. Applied Soft Computing 23, 227–238 (2014)

    Article  Google Scholar 

  8. Kiran, M.S., Findik, O.: A directed artificial bee colony algorithm. Applied Soft Computing 26, 454–462 (2015)

    Article  Google Scholar 

  9. Ozturk, C., Hancer, E., Karaboga, D.: Dynamic clustering with improved binary artificial bee colony algorithm. Applied Soft Computing 28, 69–80 (2015)

    Article  Google Scholar 

  10. Ozturk, C., Hancer, E., Karaboga, D.: Improved clustering criterion for image clustering with artificial bee colony algorithm. Pattern Analysis and Applications, 1–13 (2014)

    Google Scholar 

  11. Pan, Q.K., Wang, L., Li, J.Q., et al.: A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan inimisation. Omega 45, 42–56 (2014)

    Article  Google Scholar 

  12. Cui, Z., Gu, X.: An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems. Neurocomputing 148, 248–259 (2015)

    Article  Google Scholar 

  13. Yuen, S.Y., Chow, C.K.: A genetic algorithm that adaptively mutates and never revisits. IEEE Transactions on Evolutionary Computation. 13, 454–472 (2009)

    Article  Google Scholar 

  14. Chow, C.K., Yuen, S.Y.: An Evolutionary Algorithm that Makes Decision Based on the Entire Previous Search History. IEEE Transactions on Evolutionary Computation 15, 741–769 (2011)

    Article  Google Scholar 

  15. Leung, S.W., Yuen, S.Y., Chow, C.K.: Parameter control system of evolutionary algorithm that is aided by the entire search history. Applied Soft Computing. 12, 3063–3078 (2012)

    Article  Google Scholar 

  16. Lou, Y., Li, J., Shi, Y., Jin, L.: Gravitational co-evolution and opposition-based optimization algorithm. International Journal of Computational Intelligence Systems 6, 849–861 (2013)

    Article  Google Scholar 

  17. Lou, Y., Li, J., Jin, L., Li, G.: A coEvolutionary algorithm based on elitism and gravitational evolution strategies. Journal of Computational Information Systems 8, 2741–2750 (2012)

    Google Scholar 

  18. Wu, Z., Chow, T.W.S.: Neighborhood field for cooperative optimization. Soft Computing 17, 819–834 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Electronic and Communication Engineering, Tianjin Normal University, Tianjin, China

    Xin Zhang

  2. Department of Electrical Electronic and Computer Engineering, University of Pretoria, Hatfield, Pretoria, South Africa

    Zhou Wu

Authors
  1. Xin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhou Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhou Wu .

Editor information

Editors and Affiliations

  1. Peking University, Beijing, China

    Ying Tan

  2. Xi'an Jiaotong-Liverpool University, Suzhou, China

    Yuhui Shi

  3. Universidade de Pernambuco, Recife, Brazil

    Fernando Buarque

  4. Instituto Politécnico Nacional, Mexico, Mexico

    Alexander Gelbukh

  5. Indian Statistical Institute, Kolkata, India

    Swagatam Das

  6. University of Pretoria, Pretoria, South Africa

    Andries Engelbrecht

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, X., Wu, Z. (2015). An Artificial Bee Colony Algorithm with History-Driven Scout Bees Phase. In: Tan, Y., Shi, Y., Buarque, F., Gelbukh, A., Das, S., Engelbrecht, A. (eds) Advances in Swarm and Computational Intelligence. ICSI 2015. Lecture Notes in Computer Science(), vol 9140. Springer, Cham. https://doi.org/10.1007/978-3-319-20466-6_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20466-6_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20465-9

  • Online ISBN: 978-3-319-20466-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation