[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

ABC-X: a generalized, automatically configurable artificial bee colony framework

  • Published:
Swarm Intelligence Aims and scope Submit manuscript

Abstract

The artificial bee colony (ABC) algorithm is a popular metaheuristic that was originally conceived for tackling continuous function optimization tasks. Over the last decade, a large number of variants of ABC have been proposed, making it by now a well-studied swarm intelligence algorithm. Typically, in a paper on algorithmic variants of ABC algorithms, one or at most two of its algorithmic components are modified. Possible changes include variations on the search equations, the selection of candidate solutions to be explored, or the adoption of features from other algorithmic techniques. In this article, we propose to follow a different direction and to build a generalized ABC algorithm, which we call ABC-X. ABC-X collects algorithmic components available from known ABC algorithms into a common algorithm framework that allows not only to instantiate known ABC variants but, more importantly, also many ABC algorithm variants that have never been explored before in the literature. Automatic algorithm configuration techniques can generate from this template new ABC variants that perform better than known ABC algorithms, even when their numerical parameters are fine-tuned using the same automatic configuration process.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. Some test functions are present in more than one benchmark set with different shift and rotate vectors. In this case, we only considered the function in the most recent benchmark set.

  2. We take here always the first configuration; as the configurations have been independently generated of each other, taking a configuration at an arbitrary, fixed position in the sequence of tuned configurations corresponds to taking a random one.

  3. Note that we do not claim that the separation of the problems as done here is the best possible. Our separation was guided by one specific, known feature of the available functions, which is, however, also a prominent and common one used to classify the problems in the various benchmark sets. Further work should examine alternative ways of classifying the benchmark problems, which could be exploiting other features and landscape features such as those examined by Mersmann et al. (2011).

  4. We have used the Wilcoxon test to determine whether statistically significant differences arise on each function for each dimension. If no statistically significant difference is observed, this is reported as draw.

  5. Note that for the tuning, we did not use the default ABC algorithm parameter settings as one of the initial configurations, although this could be done with irace.

References

  • Akay, B., & Karaboga, D. (2012). A modified artificial bee colony algorithm for real-parameter optimization. Information Sciences, 192, 120–142.

    Article  Google Scholar 

  • Alatas, B. (2010). Chaotic bee colony algorithms for global numerical optimization. Expert Systems with Applications, 37(8), 5682–5687.

    Article  Google Scholar 

  • Auger, A., & Hansen, N. (2005). A restart CMA evolution strategy with increasing population size. In Proceedings of the 2005 congress on evolutionary computation (CEC 2005) (pp. 1769–1776). Piscataway, NJ: IEEE Press.

  • Aydın, D. (2015). Composite artificial bee colony algorithms: From component-based analysis to high-performing algorithms. Applied Soft Computing, 32, 266–285.

    Article  Google Scholar 

  • Aydın, D., & Özyön, S. (2013). Solution to non-convex economic dispatch problem with valve point effects by incremental artificial bee colony with local search. Applied Soft Computing, 13(5), 2456–2466.

    Article  Google Scholar 

  • Aydın, D., & Stützle, T. (2015). A configurable generalized artificial bee colony algorithm with local search strategies. In Proceedings of the 2015 IEEE congress on evolutionary computation (CEC) (pp. 1067–1074). Piscataway, NJ: IEEE Press.

  • Aydın, D., Liao, T., de Oca, M. A. M., & Stützle, T. (2012). Improving performance via population growth and local search: The case of the artificial bee colony algorithm. In J. K. Hao, et al. (Eds.), Artificial evolution. Lecture notes in computer science (Vol. 7401, pp. 85–96). Heidelberg: Springer.

    Google Scholar 

  • Aydin, D., Özyön, S., Yaşar, C., & Liao, T. (2014). Artificial bee colony algorithm with dynamic population size to combined economic and emission dispatch problem. International Journal of Electrical Power & Energy Systems, 54, 144–153.

    Article  Google Scholar 

  • Banharnsakun, A., Achalakul, T., & Sirinaovakul, B. (2011). The best-so-far selection in artificial bee colony algorithm. Applied Soft Computing, 11(2), 2888–2901.

    Article  Google Scholar 

  • Banitalebi, A., Aziz, M. I. A., Bahar, A., & Aziz, Z. A. (2015). Enhanced compact artificial bee colony. Information Sciences, 298, 491–511.

    Article  Google Scholar 

  • Bao, L., & Zeng, J. C. (2011). A bi-group differential artificial bee colony algorithm. Control Theory & Applications, 28(2), 266–272.

    MathSciNet  Google Scholar 

  • Bezerra, L. C. T., López-Ibáñez, M., & Stützle, T. (2016). Automatic component-wise design of multi-objective evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 20(3), 403–417.

    Article  Google Scholar 

  • Bin, W., & Qian, C. H. (2011). Differential artificial bee colony algorithm for global numerical optimization. Journal of Computers, 6(5), 841–848.

    Article  Google Scholar 

  • Birattari, M., Stützle, T., Paquete, L., & Varrentrapp, K. (2002). A racing algorithm for configuring metaheuristics. In W. B. Langdon, et al. (Eds.), Proceedings of the genetic and evolutionary computation conference, GECCO 2002 (Vol. 2, pp. 11–18). San Francisco, CA: Morgan Kaufmann Publishers.

    Google Scholar 

  • Birattari, M., Yuan, Z., Balaprakash, P., & Stützle, T. (2010). F-race and iterated F-race: An overview. In T. Bartz-Beielstein, M. Chiarandini, L. Paquete, & M. Preuss (Eds.), Experimental methods for the analysis of optimization algorithms (pp. 311–336). Berlin: Springer.

    Chapter  Google Scholar 

  • Conover, W. J. (1999). Practical Nonparametric Statistics (3rd ed.). New York, NY: Wiley.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  • El-Abd, M. (2011). Opposition-based artificial bee colony algorithm. In N. Krasnogor & P. L. Lanzi (Eds.), Proceedings of the 13th annual conference on genetic and evolutionary computation, GECCO 2011 (pp. 109–116). New York, NY: ACM Press.

    Google Scholar 

  • Gao, W., & Liu, S. Y. (2011). Improved artificial bee colony algorithm for global optimization. Information Processing Letters, 111(17), 871–882.

    Article  MathSciNet  MATH  Google Scholar 

  • Gao, W., & Liu, S. Y. (2012). A modified artificial bee colony algorithm. Computers & Operations Research, 39(3), 687–697.

    Article  MATH  Google Scholar 

  • Gao, W., Liu, S. Y., & Huang, L. L. (2012). A global best artificial bee colony algorithm for global optimization. Journal of Computational and Applied Mathematics, 236(11), 2741–2753.

    Article  MathSciNet  MATH  Google Scholar 

  • Gao, W., Liu, S. Y., & Huang, L. L. (2014). Enhancing artificial bee colony algorithm using more information-based search equations. Information Sciences, 270, 112–133.

    Article  MathSciNet  MATH  Google Scholar 

  • Gao, W., Huang, L. L., Liu, S. Y., Chan, F. T., Dai, C., & Shan, X. (2015). Artificial bee colony algorithm with multiple search strategies. Applied Mathematics and Computation, 271, 269–287.

    Article  MathSciNet  Google Scholar 

  • Herrera, F., Lozano, M., & Molina, D. (2010). Test suite for the special issue of soft computing on scalability of evolutionary algorithms and other metaheuristics for large scale continuous optimization problems. http://sci2s.ugr.es/eamhco/updated-functions1-19.pdf.

  • Hoos, H. H. (2012). Programming by optimization. Communications of the ACM, 55(2), 70–80.

    Article  Google Scholar 

  • Hutter, F., Hoos, H. H., Leyton-Brown, K., & Stützle, T. (2009). ParamILS: An automatic algorithm configuration framework. Journal of Artificial Intelligence Research, 36(1), 267–306.

    MATH  Google Scholar 

  • Imanian, N., Shiri, M. E., & Moradi, P. (2014). Velocity based artificial bee colony algorithm for high dimensional continuous optimization problems. Engineering Applications of Artificial Intelligence, 36, 148–163.

    Article  Google Scholar 

  • Kang, F., Li, J., & Ma, Z. (2011a). Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions. Information Sciences, 181(16), 3508–3531.

    Article  MathSciNet  MATH  Google Scholar 

  • Kang, F., Li, J., Ma, Z., & Li, H. (2011b). Artificial bee colony algorithm with local search for numerical optimization. Journal of Software, 6(3), 490–497.

    Article  Google Scholar 

  • Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization. Technical report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department.

  • Karaboga, D. (2014). The C code of original ABC algorithm by Dervis Karaboga. http://mf.erciyes.edu.tr/abc/.

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

    Article  MathSciNet  MATH  Google Scholar 

  • Karaboga, D., & Akay, B. (2009). A survey: Algorithms simulating bee swarm intelligence. Artificial Intelligence Review, 31(1–4), 61–85.

    Article  Google Scholar 

  • Karaboga, D., Gorkemli, B., Ozturk, C., & Karaboga, N. (2014). A comprehensive survey: Artificial bee colony (ABC) algorithm and applications. Artificial Intelligence Review, 42(1), 21–57.

    Article  Google Scholar 

  • Karafotias, G., Hoogendoorn, M., & Eiben, A. E. (2015). Parameter control in evolutionary algorithms: Trends and challenges. IEEE Transactions on Evolutionary Computation, 19(2), 167–187.

    Article  Google Scholar 

  • KhudaBukhsh, A. R., Xu, L., Hoos, H. H., & Leyton-Brown, K. (2016). SATenstein: Automatically building local search SAT solvers from components. Artificial Intelligence, 232, 20–42.

    Article  MathSciNet  MATH  Google Scholar 

  • Liang, J. J., Qu, B.-Y., & Suganthan, P. N. (2013). Problem Definitions and Evaluation Criteria for the CEC 2014 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization. Technical Report 201311, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Technical Report, Nanyang Technological University, Singapore.

  • Liang, J., Qu, B., Suganthan, P., & Chen, Q. (2015). Problem definitions and evaluation criteria for the CEC 2015 competition on learning-based real-parameter single objective optimization. Technical report 201411A, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore.

  • Liao, T., Montes de Oca, M. A., Aydin, D., Stützle, T., & Dorigo, M. (2011). An incremental ant colony algorithm with local search for continuous optimization. In N. Krasnogor & P. L. Lanzi (Eds.), Proceedings of the 13th annual conference on genetic and evolutionary computation, GECCO 2011 (pp. 125–132). New York, NY: ACM Press.

    Google Scholar 

  • Liao, T., Aydın, D., & Stützle, T. (2013). Artificial bee colonies for continuous optimization: Experimental analysis and improvements. Swarm Intelligence, 7(4), 327–356.

    Article  Google Scholar 

  • Liao, T., Stützle, T., de Oca, M. A. M., & Dorigo, M. (2014). A unified ant colony optimization algorithm for continuous optimization. European Journal of Operational Research, 234(3), 597–609.

    Article  MathSciNet  MATH  Google Scholar 

  • Li, X., & Yang, G. (2016). Artificial bee colony algorithm with memory. Applied Soft Computing, 41, 362–372.

    Article  Google Scholar 

  • López-Ibáñez, M., & Stützle, T. (2012). The automatic design of multi-objective ant colony optimization algorithms. IEEE Transactions on Evolutionary Computation, 16(6), 861–875.

    Article  Google Scholar 

  • López-Ibáñez, M., Dubois-Lacoste, J., Stützle, T., & Birattari, M. (2011). The irace package: Iterated racing for automatic algorithm configuration. Technical report TR/IRIDIA/2011-004, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium.

  • López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Stützle, T., & Birattari, M. (2016). The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives, 3, 43–58.

    Article  MathSciNet  Google Scholar 

  • Lu, P., Zhou, J., Zhang, H., Zhang, R., & Wang, C. (2014). Chaotic differential bee colony optimization algorithm for dynamic economic dispatch problem with valve-point effects. International Journal of Electrical Power & Energy Systems, 62, 130–143.

    Article  Google Scholar 

  • Mallipeddi, R., Suganthan, P. N., Pan, Q. K., & Tasgetiren, M. F. (2011). Differential evolution algorithm with ensemble of parameters and mutation strategies. Applied Soft Computing, 11(2), 1679–1696.

    Article  Google Scholar 

  • Maron, O., & Moore, A. W. (1997). The racing algorithm: Model selection for lazy learners. Artificial Intelligence Research, 11(1–5), 193–225.

    Article  Google Scholar 

  • Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., & Rudolph, G. (2011). Exploratory landscape analysis. In N. Krasnogor & P. L. Lanzi (Eds.), Proceedings of the 13th annual conference on genetic and evolutionary computation, GECCO 2011 (pp. 829–836). New York, NY: ACM Press.

    Google Scholar 

  • Montes de Oca, M. A., Stutzle, T., Van den Enden, K., & Dorigo, M. (2011). Incremental social learning in particle swarms. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 41(2), 368–384.

    Article  Google Scholar 

  • Rudolph, G. (2014). Critical review of modern bio-inspired optimization methods. In Invited talk, ninth international conference on swarm intelligence, ANTS 2014.

  • Sharma, T. K., & Pant, M. (2013). Enhancing the food locations in an artificial bee colony algorithm. Soft Computing, 17(10), 1939–1965.

    Article  Google Scholar 

  • Sörensen, K. (2015). Metaheuristics–The metaphor exposed. International Transactions on Operational Research, 22(1), 3–18.

    Article  MathSciNet  MATH  Google Scholar 

  • Stützle, T., & López-Ibáñez, M. (2015). Automatic (offline) configuration of algorithms. In J. L. J. Laredo, S. Silva, & A. I. Esparcia-Alcázar (Eds.), Genetic and evolutionary computation conference, GECCO 2015 (pp. 681–702). New York, NY: Companion Material Proceedings, ACM Press.

  • Suganthan, P. N., Hansen, N., Liang, J. J., Deb, K., Chen, Y. P., & Auger, A., et al. (2005). Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL Report 2005005.

  • Tseng, L. Y., & Chen, C. (2008). Multiple trajectory search for large scale global optimization. In IEEE congress on evolutionary computation, CEC 2008 (pp. 3052–3059). Piscataway, NJ: IEEE Press.

  • Xiang, W., & An, M. (2013). An efficient and robust artificial bee colony algorithm for numerical optimization. Computers & Operations Research, 40(5), 1256–1265.

    Article  MathSciNet  MATH  Google Scholar 

  • Xiang, W., Ma, S., & An, M. (2014). hABCDE: A hybrid evolutionary algorithm based on artificial bee colony algorithm and differential evolution. Applied Mathematics and Computation, 238, 370–386.

    Article  MathSciNet  MATH  Google Scholar 

  • Yu, W. J., Zha, Z. H., & Zhang, J. (2016). Artificial bee colony algorithm with an adaptive greedy position update strategy. Soft Computing. doi:10.1007/s00500-016-2334-4.

  • Yuan, Z., Montes de Oca, M. A., Stützle, T., & Birattari, M. (2012). Continuous optimization algorithms for tuning real and integer parameters of swarm intelligence algorithms. Swarm Intelligence, 6(1), 49–75.

    Article  Google Scholar 

  • Yurtkuran, A., & Emel, E. (2015). An adaptive artificial bee colony algorithm for global optimization. Applied Mathematics and Computation, 271, 1004–1023.

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by the Scientific and Technical Research Council of Turkey (TUBITAK) and by the COMEX Project (P7/36) within the Inter-university Attraction Poles Programme of the Belgian Science Policy Office. Thomas Stützle acknowledges support from the Belgian F.R.S.-FNRS, of which he is a senior research associate.

Author information

Authors and Affiliations

  1. Computer Engineering Department, Dumlupinar University, 43000, Kutahya, Turkey

    Doğan Aydın & Gürcan Yavuz

  2. IRIDIA, CoDE, Université Libre de Bruxelles (ULB), Brussels, Belgium

    Thomas Stützle

Authors
  1. Doğan Aydın
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gürcan Yavuz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Stützle
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Stützle.

Additional information

The rational underlying the design of ABC-X has, in part, been presented in an earlier conference paper, which was submitted accompanying our submission for the CEC’15 benchmark competition on learning-based real-parameter single-objective optimization (Aydın and Stützle 2015). The contribution of that paper is discussed in the “Related work and discussion” section of the present article.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Aydın, D., Yavuz, G. & Stützle, T. ABC-X: a generalized, automatically configurable artificial bee colony framework. Swarm Intell 11, 1–38 (2017). https://doi.org/10.1007/s11721-017-0131-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11721-017-0131-z

Keywords

Search

Navigation