Soft Computing

, Volume 18, Issue 5, pp 871–903 | Cite as

Benchmarking and comparison of nature-inspired population-based continuous optimisation algorithms

Methodologies and Application

Abstract

This paper describes an experimental investigation into four nature-inspired population-based continuous optimisation methods: the Bees Algorithm, Evolutionary Algorithms, Particle Swarm Optimisation, and the Artificial Bee Colony algorithm. The aim of the proposed study is to understand and compare the specific capabilities of each optimisation algorithm. For each algorithm, thirty-two configurations covering different combinations of operators and learning parameters were examined. In order to evaluate the optimisation procedures, twenty-five function minimisation benchmarks were designed by the authors. The proposed set of benchmarks includes many diverse fitness landscapes, and constitutes a contribution to the systematic study of optimisation techniques and operators. The experimental results highlight the strengths and weaknesses of the algorithms and configurations tested. The existence and extent of origin and alignment search biases related to the use of different recombination operators are highlighted. The analysis of the results reveals interesting regularities that help to identify some of the crucial issues in the choice and configuration of the search algorithms.

Keywords

Optimisation Bees algorithm Swarm intelligence  Evolutionary algorithms Optimisation benchmarks 

References

  1. Adorio EP (2005) MVF–multivariate test functions library in C for unconstrained global optimization. http://geocities.com/eadorio/mvf.pdf
  2. Baeck T, Hoffmeister F, Schwefel HP (1991) A survey of evolution strategies. In: Proceedings fourth international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 2–9Google Scholar
  3. Balázs K, Botzheim J, Kóczy LT (2010) Comparison of various evolutionary and memetic algorithms. In: Integrated uncertainty management and applications. Springer, Berlin, pp 431–442Google Scholar
  4. Bersini H, Dorigo M, Langerman S, Seront G, Gambardella L (1996) Results of the first international contest on evolutionary optimisation (1st ICEO). In: Proceedings of IEEE international conference evolutionary computation. IEEE Press, Nagoya, Japan, pp 611–615Google Scholar
  5. Blackwell T, Branke J (2004) Multi-swarm optimization in dynamic environments, applications of evolutionary computing. In: Raidl GR (ed) Lecture notes in computer science, vol 3005. Springer, Berlin, pp 489–500Google Scholar
  6. Bonabeau E, Dorigo M, Theraulaz G (1999) Swarm intelligence: from natural to artificial systems. Oxford University Press, New YorkMATHGoogle Scholar
  7. Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B 26(1):29–41CrossRefGoogle Scholar
  8. Dréo J, Siarry P (2004) Continuous interacting ant colony algorithm based on dense heterarchy. Future Gener Comput Syst 20:841–856CrossRefGoogle Scholar
  9. El-Abd M (2012) Performance assessment of foraging algorithms vs. evolutionary algorithms. Inf Sci 182(1):243–263CrossRefMathSciNetGoogle Scholar
  10. Elbeltagi E, Hegazy T, Grierson D (2005) Comparison among five evolutionary-based optimization algorithms. Adv Eng Inform 19(1):43–53CrossRefGoogle Scholar
  11. Engelbrecht AP (2005) Fundamentals of computational swarm intelligence. Wiley, ChichesterGoogle Scholar
  12. Fogel DB (2000) Evolutionary computation: toward a new philosophy of machine intelligence, 2nd edn. IEEE Press, New YorkGoogle Scholar
  13. Fogel LJ, Owens AJ, Walsh MJ (1966) Artificial intelligence through simulated evolution. Wiley, New YorkMATHGoogle Scholar
  14. García-Nieto J, Alba E (2010) Restart particle swarm optimization with velocity modulation: a scalability test. Soft Comput. doi:10.1007/s00500-010-0648-1. http://sci2s.ugr.es/EAMHCO/pdf-soco/P09.pdf
  15. Goldberg DE (1989) Genetic algorithms in search, optimisation and machine learning. Addison Wesley, ReadingGoogle Scholar
  16. 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
  17. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann ArborGoogle Scholar
  18. Juang CF (2004) A hybrid of genetic algorithm and particle swarm optimization for recurrent network design. IEEE Trans Syst Man Cybern Part B Cybern 34(2):997–1006CrossRefGoogle Scholar
  19. Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department. http://mf.erciyes.edu.tr/abc/pub/tr06_2005.pdf
  20. Karaboga D, Akay D (2009) Artificial bee colony, harmony search and bees algorithms on numerical optimization. In: Proceedings of 5th international virtual conference on intelligent production machines and systems (IPROMS 2009). Whittles, Dunbeath, Scotland, pp 417–422Google Scholar
  21. Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687–697CrossRefGoogle Scholar
  22. Kennedy J (2006) Swarm intelligence, handbook of nature-inspired and innovative computing. In: Zomaya A (ed). Springer, USA, pp 187–219Google Scholar
  23. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of 1995 IEEE international conference on neural networks, Perth, Australia, vol 4. IEEE Press, New York, NY, pp 1942– 1948Google Scholar
  24. Koza JR (1992) Genetic Programming: on the programming of computers by means of natural selection. MIT Press, CambridgeMATHGoogle Scholar
  25. Liao T, Montes de Oca MA, Aydin DG, Stuetzle T, Dorigo M (2011) An incremental ACOR with local search for continuous optimization problems. IRIDIA Technical report number TR/IRIDIA/2011-005. http://iridia.ulb.ac.be/IridiaTrSeries/IridiaTr2011-005r001.pdf
  26. MacNish C (2007) Towards unbiased benchmarking of evolutionary and hybrid algorithms for real-valued optimisation. Connect Sci 19(4):361–385CrossRefGoogle Scholar
  27. Mehrabian AR, Lucas C (2006) A novel numerical optimization algorithm inspired from weed colonization. Ecol Inf 1(4):355–366CrossRefGoogle Scholar
  28. Mengshoel OJ, Goldberg DE (2008) The crowding approach to niching in genetic algorithms. Evol Comput 16(3):315–354CrossRefGoogle Scholar
  29. Molga M, Smutnicki C (2005) Test functions for optimization needs. http://www.zsd.ict.pwr.wroc.pl/files/docs/functions.pdf
  30. Monson CK, Seppi KD (2005) Exposing origin-seeking Bias in PSO. In: Proceedings of 2005 genetic and evolutionary computation conference (GECCO), Washington, DC. ACM Press, New York, NY, pp 241–248Google Scholar
  31. Olague G, Puente C (2006) Parisian evolution with honeybees for three-dimensional reconstruction. In: Proceedings of 2006 genetic and evolutionary computation conference (GECCO). ACM Press, New York, NY, pp 191–198Google Scholar
  32. Passino KM (2002) Biomimicry of bacterial foraging for distributed optimisation and control. IEEE Control Syst Mag (June), pp 52– 67Google Scholar
  33. Pham DT, Castellani M (2009) The bees algorithm—modelling foraging behaviour to solve continuous optimisation problems. Proc ImechE Part C 223(12):2919–2938CrossRefGoogle Scholar
  34. Pham DT, Castellani M (2010) Adaptive selection routine for evolutionary algorithms. J Syst Control Eng 224(16):623–633Google Scholar
  35. Pham DT, Sholedolu M (2008), Using a hybrid PSO-bees algorithm to train neural networks for wood defect classification. In: Proceedings of 4th international virtual conference on intelligent production machines and systems (IPROMS 2008), Whittles, Dunbeath, Scotland, pp 385–390Google Scholar
  36. Pham DT, Ghanbarzadeh A, Koc E, Otri S, Rahim S, Zaidi M (2005) The bees algorithm. Manufacturing Engineering Centre, Cardiff University, UK. Technical NoteGoogle Scholar
  37. Pham DT, Ghanbarzadeh A, Koç E, Otri S, Rahim S, Zaidi M (2006) The bees algorithm, a novel tool for complex optimisation problems. In: Proceedings of 2nd international virtual conference on intelligent production machines and systems (IPROMS 2006). Elsevier, Oxford, pp 454–459Google Scholar
  38. Rechenberg I (1965) Cybernetic solution path of an experimental problem, library translation no. 1122, Ministry of Aviation, Royal Aircraft Establishment, Farnborough, Hants, UKGoogle Scholar
  39. Roth M, Wicker S (2003) Termite: ad-hoc networking with stigmergy. In: Proceedings of global telecommunications conference GLOBECOM ’03, vol 5. IEEE press, San Francisco, CA, pp 2937–2941Google Scholar
  40. Sato T, Hagiwara M (1997) Bee system: finding solution by a concentrated search. In: Proceedings of IEEE international conference systems, Man, & Cybernetics. IEEE Press, New York, NY, pp 3954–3959Google Scholar
  41. Shi Y, Eberhart R (1998) Parameter selection in particle swarm optimization. In: Proceedings of seventh annual conference on evolutionary programming, San Diego, CA, Lecture Notes in Computer Science volume 1447, Springer, Berlin, pp 591–600Google Scholar
  42. Shi XH, Lu YH, Zhou CG, Lee HP, Lin WZ, Liang YC (2003) Hybrid evolutionary algorithms based on PSO and GA. In: Proceedings IEEE congress Evolutionary computation, Canberra, Australia. IEEE Press, Piscataway, NJ, pp 2393–2399Google Scholar
  43. Socha K, Dorigo M (2008) Ant colony optimisation for continuous domains. Eur J Oper Res 185:1155–1173CrossRefMATHMathSciNetGoogle Scholar
  44. Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341–359 Google Scholar
  45. Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC, special session on real-parameter optimization. KanGAL Report 2005005:2005Google Scholar
  46. Tang K, Yao X, Suganthan PN, MacNish C, Chen YP, Chen CM, Yang Z (2007) Benchmark functions for the CEC’2008 special session and competition on large scale global optimization. Technical report, Nature Inspired Computation and Applications Laboratory, USTC, Hefei, Anhui, China. http://nical.ustc.edu.cn/cec08ss.php
  47. Tang K, Li X, Suganthan PN, Yang Z, Weise T (2009) Benchmark functions for the CEC’2010 special session and competition on large scale global optimization. Technical report, Nature Inspired Computation and Applications Laboratory, USTC, Hefei, Anhui, China., http://nical.ustc.edu.cn/cec10ss.php
  48. Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82CrossRefGoogle Scholar
  49. Yang XS (2008) Nature-inspired metaheuristic algorithms. Luniver Press, UKGoogle Scholar
  50. Yang XS, Deb S (2010) Engineering optimisation by cuckoo search. Int J Math Model Numer Optim 1(4):330–343MATHGoogle Scholar
  51. Zapfel G, Braune R, Bogl M (2010) Metaheuristic search concepts. Springer, BerlinGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.School of Mechanical EngineeringUniversity of BirminghamBirminghamUK
  2. 2.Department of BiologyUniversity of BergenBergenNorway

Personalised recommendations