Skip to main content

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

Included in the following conference series:

Abstract

Inspired by the behavior of the honeybees’ collecting pollen, Bee Collecting Pollen Algorithm (BCPA) is proposed in this paper. This is a novel global convergence searching algorithm. It simulates the behavior of the honeybees’ collecting pollen and describes the swarm intelligent. The experiment for TSP shows that the improve algorithm is more efficient.

This work was supported by Grants 60461001 from NSF of China and project supported by grants 0542048; 0832082 from Guangxi science foundation, and Innovation Project of Guangxi Graduate Education.

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 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Eberhart, R.C., Kennedy, J.: A New Optimizer Using Particle Swarm Theory. In: Proceedings of the Sixth International Symposium on Micromachine and Human Science, Nogoya, Japan, pp. 39–43 (1995)

    Google Scholar 

  2. Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 26(1), 29–41 (1996)

    Article  Google Scholar 

  3. Abbass, H.A.: Marriage in Honeybees Optimization (MBO): A Haplometrosis Polygynous Swarming Approach. In: The Congress on Evolutionary Computation, Seoul, Korea. CEC 2001, pp. 207–214 (2001)

    Google Scholar 

  4. Abbass, H.A.: Amonogenous MBO Approach to Satisfiability. In: The International Conference on Computational Intelligence for Modelling. Control and Automation, CIMCA 2001, LasVegas, NV, USA (2001)

    Google Scholar 

  5. Abbass, H.A., Teo, J.: A True Annealing Approach to the Marriage in Honeybee’s Optimization Algorithm. In: Proc. of the Inaugural Workshop on Artificial Life (AL 2001), pp. 1–14 (2001)

    Google Scholar 

  6. Bozorg, H.O., Afshar, A.: MBO (Marriage Bees Optimization): A New Heuristic Approach in Hydro Systems Design and Operation. In: Proceedings of 1st International Conference on Managing Rivers in the 21st Century: Issues and Challenges, Penang, Malaysia, pp. 499–504 (2004)

    Google Scholar 

  7. Bozorg, H.O., Afshar, A., Marin, M.A.: Honeybees Mating Optimization Algorithm (HBMO): A New Heuristic Approach for Engineering Optimization. In: Proceeding of the First International Conference on Modeling, Simulation and Applied Optimization (ICMSA 2005), Sharjah, UAS (2005)

    Google Scholar 

  8. Afshar, A., Bozog, H.O., Marin, M.A., Adams, B.J.: Honeybee Mating Optimization (HBMO) Algorithm for Optimal Reservoir Operation. Journal of the Franklin Institute (in Press, 2006)

    Google Scholar 

  9. Nakrani, S., Tovey, C.: On Honey Bees and Dynamic Allocation in an Internet Server Colony. Adaptive Behavior 12(3-4), 223–240 (2004)

    Article  Google Scholar 

  10. Teodorovic, D., Dell’orco, M.: Bee Colony Optimization: A Cooperative Learning Approach to Complex Transportation Problems. Advanced OR and AI Methods in Transportation, 51–60 (2005)

    Google Scholar 

  11. Sung, H.J.: Queen-Bee Evolution for Genetic Algorithms. Electronics Letters 39(6), 575–576 (2003)

    Article  Google Scholar 

  12. Mohammad, F.B.A.: A Honeybee-Mating Approach for Cluster Analysis. Springer, London (2007)

    Google Scholar 

  13. Bozorg, H.O., Afshar, A., Marin, M.A.: Honey-Bees Mating Optimization Algorithm (HBMO): A New Heuristic Approach for Water Resource Optimization. Water Resource Management 20, 661–680 (2006)

    Article  Google Scholar 

  14. Hyeong, S.C.: Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Program. Journal of Global Optimization 35, 423–441 (2006)

    Article  MATH  Google Scholar 

  15. Chin, S.C., Malcolm, Y.H.L., Appa, I.S., Kheng, L.G.: A Bee Colony Optimization Algorithm to Job Shop Scheduling. In: Proceeding of the 2006 Winter Simulation Conference, pp. 1954–1961 (2006)

    Google Scholar 

  16. Curkovic, P., Jerbic, B.: Honey-Bees Optimization Algorithm Applied to Path Planning Problem. Int. J. Simul. Model 6(3), 154–164 (2007)

    Article  Google Scholar 

  17. Abbass, H.A.: A Single Queen Single Worker Honey-bees Approach to 3-SAT. In: Proceedings of the Genetic and Evolutionary Computation Conference, San Francisco, USA, pp. 807–814 (2001)

    Google Scholar 

  18. Teo, J., Abbass, H.A.: An Annealing Approach to the Mating-flight Trajectories in the Marriage in Honey Bees Optimization Algorithm, Technical Report CS04/01, School of Computer Science, University of New South Wales at ADFA (2001)

    Google Scholar 

  19. Seeley, T.D.: The Wisdom of the Hive. Publication Harward University Press

    Google Scholar 

  20. http://elib.zib.de/pub/Packages/mp2testdata/tsp/tsplib/tsplib.html

Download references

Author information

Authors and Affiliations

Authors

Editor information

De-Shuang Huang Donald C. Wunsch II Daniel S. Levine Kang-Hyun Jo

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lu, X., Zhou, Y. (2008). A Novel Global Convergence Algorithm: Bee Collecting Pollen Algorithm. In: Huang, DS., Wunsch, D.C., Levine, D.S., Jo, KH. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2008. Lecture Notes in Computer Science(), vol 5227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85984-0_62

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85984-0_62

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85983-3

  • Online ISBN: 978-3-540-85984-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics