Skip to main content

Artificial Bee Clustering Search

  • Conference paper
Advances in Computational Intelligence (IWANN 2013)

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

Included in the following conference series:

  • 2305 Accesses

Abstract

Clustering Search (*CS) has been proposed as a generic way of combining search metaheuristics with clustering to detect promising search areas before applying local search procedures. The clustering process may keep representative solutions associated to different search subspaces (search areas). In this work, a new approach is proposed, based on Artificial Bee Colony (ABC), observing the inherent characteristics of detecting promissing food sources employed by that metaheuristic. The proposed hybrid algorithm, performing a Hooke & Jeeves based local, is compared against other versions of ABC: a pure ABC and another hybrid ABC, exploring an elitist criteria.

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 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.: An Idea Based On Honey Bee Swarm for Numerical Optimization, Technical Report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department (2005)

    Google Scholar 

  2. Karaboga, D., Akay, B.: A comparative study of Artificial Bee Colony Algorithm. Applied Mathematics and Computation 214, 108–132 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hooke, R., Jeeves, T.A.: Direct search solution of numerical and statistical problems. J. Assoc. Comput. Mach. 8, 212–229 (1961)

    Article  MATH  Google Scholar 

  4. Oliveira, A.C.M., Lorena, L.A.N.: Detecting promising areas by evolutionary clustering search. In: Bazzan, A.L.C., Labidi, S. (eds.) SBIA 2004. LNCS (LNAI), vol. 3171, pp. 385–394. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Chaves, A.A., Correa, F.A., Lorena, L.A.N.: Clustering Search Heuristic for the Capacitated p-median Problem. Springer Advances in Software Computing Series 44, 136–143 (2007)

    Google Scholar 

  6. Costa, T.S., Oliveira, A.C.M., Lorena, L.A.N.: Advances in Clustering Search. Advances in Soft Computing 73, 227–235 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Costa, T.S., de Oliveira, A.C.M. (2013). Artificial Bee Clustering Search. In: Rojas, I., Joya, G., Cabestany, J. (eds) Advances in Computational Intelligence. IWANN 2013. Lecture Notes in Computer Science, vol 7903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38682-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38682-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38681-7

  • Online ISBN: 978-3-642-38682-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics