Skip to main content
SpringerLink
Log in

Opposition based lévy flight artificial bee colony

  • Regular Research Paper
  • Published:
Memetic Computing Aims and scope Submit manuscript

Abstract

Artificial Bee Colony (ABC) is a well known optimization approach to solve nonlinear and complex problems. It is relatively a simple and recent population based probabilistic approach for global optimization. Similar to other population based algorithms, ABC is also computationally expensive due to its slow nature of search process. The solution search equation of ABC is significantly influenced by a random quantity which helps in exploration at the cost of exploitation of the search space. In the solution search equation of ABC due to the large step size the chance of skipping the true solution is high. Therefore, in this paper, to balance the diversity and convergence capability of the ABC, Lévy Flight random walk based local search strategy is proposed and incorporated with ABC along with opposition based learning strategy. The proposed algorithm is named as Opposition Based Lévy Flight ABC. The experiments over 14 un-biased test problems of different complexities and five well known engineering optimization problems show that the proposed algorithm outperforms the basic ABC and its recent variants namely Gbest guided ABC, Best-So-Far ABC, and Modified ABC in most of the experiments.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Akay B, Karaboga D (2010) A modified artificial bee colony algorithm for real-parameter optimization. Inf Sci, doi:10.1016/j.ins.2010.07.015

  2. Ali MM, Khompatraporn C, Zabinsky ZB (2005) A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J Glob Optim 31(4):635–672

    Article  MathSciNet  MATH  Google Scholar 

  3. Banharnsakun A, Achalakul T, Sirinaovakul B (2011) The best-so-far selection in artificial bee colony algorithm. Appl Soft Comput 11(2):2888–2901

    Article  Google Scholar 

  4. Brown CT, Liebovitch LS, Glendon R (2007) Lévy flights in dobe ju/hoansi foraging patterns. Hum Ecol 35(1):129–138

    Article  Google Scholar 

  5. Das S, Suganthan PN (2010) Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems. Jadavpur University, Kolkata, India, and Nangyang Technological University, Singapore, Tech. Rep

  6. Thakur M, Deep K (2007) A new crossover operator for real coded genetic algorithms. Appl Math Comput 188(1):895–911

    Article  MathSciNet  MATH  Google Scholar 

  7. Diwold K, Aderhold A, Scheidler A, Middendorf M (2011) Performance evaluation of artificial bee colony optimization and new selection schemes. Memet Comput, 1–14

  8. Dorigo M, Di Caro G (1999) Ant colony optimization: a new meta-heuristic. In: Evolutionary computation, 1999. CEC 99. Proceedings of the 1999 congress on, 2. IEEE

  9. El-Abd M (2011) Performance assessment of foraging algorithms vs. evolutionary algorithms. Inf Sci 182(1):243–263

    Article  MathSciNet  Google Scholar 

  10. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading

  11. Hooke R, Jeeves TA (1961) “Direct search” solution of numerical and statistical problems. J ACM (JACM) 8(2):212–229

    Article  MATH  Google Scholar 

  12. Kang F, Li J, Ma Z, Li H (2011) Artificial bee colony algorithm with local search for numerical optimization. J Softw 6(3):490–497

    Google Scholar 

  13. Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Techn. Rep. TR06, Erciyes University Press, Erciyes

  14. Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108–132

    Article  MathSciNet  MATH  Google Scholar 

  15. Karaboga D, Akay B (2011) A modified artificial bee colony (ABC) algorithm for constrained optimization problems. Appl Soft Comput 11(3):3021–3031

    Google Scholar 

  16. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Neural networks, 1995. Proceedings., IEEE international conference on, 4, pp 1942–1948. IEEE

  17. Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188(2):1567–1579

    Article  MathSciNet  MATH  Google Scholar 

  18. Mezura-Montes E, Velez-Koeppel RE, (2010) Elitist artificial bee colony for constrained real-parameter optimization. In: (2010) Congress on evolutionary computation (CEC 2010). IEEE Service Center, Barcelona, Spain, pp 2068–2075

  19. Onwubolu GC, Babu BV (2004) New optimization techniques in engineering. Springer, Berlin

    Book  MATH  Google Scholar 

  20. Passino KM (2002) Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst Mag 22(3):52–67

    Google Scholar 

  21. Pavlyukevich I (2007) Lévy flights, non-local search and simulated annealing. J Comput Phys 226(2):1830–1844

    Google Scholar 

  22. Price KV, Storn RM, Lampinen JA (2005) Differential evolution: a practical approach to global optimization. Springer, Berlin

  23. Ragsdell KM, Phillips DT (1976) Optimal design of a class of welded structures using geometric programming. ASME J Eng Ind 98(3):1021–1025

    Google Scholar 

  24. Rahnamayan S, Tizhoosh HR, Salama MMA (2008) Opposition-based differential evolution. IEEE Trans Evol Comput 12(1):64–79

    Article  Google Scholar 

  25. Reynolds AM, Frye MA (2007) Free-flight odor tracking in drosophila is consistent with an optimal intermittent scale-free search. PLoS One 2(4):e354

    Article  Google Scholar 

  26. Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design optimization. J Mech Des 112:223

    Article  Google Scholar 

  27. Shlesinger MF (2006) Mathematical physics: search research. Nature 443(7109):281–282

    Article  Google Scholar 

  28. Shlesinger MF, Zaslavsky GM, Frisch U (1995) Lévy flights and related topics in physics. In Levy flights and related topics in, Physics, vol 450

  29. Storn R, Price K (1997) Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces. J Glob Optim 11:341–359

    Article  MathSciNet  MATH  Google Scholar 

  30. Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. In: CEC 2005

  31. Tizhoosh HR (2005) Opposition-based learning: a new scheme for machine intelligence. In: Computational intelligence for modelling, control and automation, 2005 and international conference on intelligent agents, web technologies and internet commerce, international conference on, 1, pp 695–701. IEEE

  32. Vesterstrom J, Thomsen R (2004) A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems. In: Evolutionary computation, 2004. CEC2004. Congress on, 2, pp 1980–1987. IEEE

  33. Wang X, Gao XZ, Ovaska SJ (2008) A simulated annealing-based immune optimization method. In: Proceedings of the international and interdisciplinary conference on adaptive knowledge representation and reasoning, porvoo, Finland, pp 41–47

  34. Williamson DF, Parker RA, Kendrick JS (1989) The box plot: a simple visual method to interpret data. Ann Intern Med 110(11):916

    Article  Google Scholar 

  35. Yang XS, Deb S (2010) Eagle strategy using lévy walk and firefly algorithms for stochastic optimization. In: Nature inspired cooperative strategies for optimization (NICSO 2010), Springer, vol 284 of studies in, Computational Intelligence, pp 101–111

  36. Yang XS (2010) Firefly algorithm, levy flights and global optimization. Research and Development in Intelligent Systems XXVI, pp 209–218

  37. Yang XS (2010) Nature-inspired metaheuristic algorithms, 2nd edn. Luniver Press, Beckington

    Google Scholar 

  38. Zhu G, Kwong S (2010) Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl Math Comput 217(7):3166–3173

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ABV-Indian Institute of Information Technology and Management, Gwalior, India

    Harish Sharma & K. V. Arya

  2. South Asian University, New Delhi, India

    Jagdish Chand Bansal

Authors
  1. Harish Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jagdish Chand Bansal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. V. Arya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Harish Sharma.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sharma, H., Bansal, J.C. & Arya, K.V. Opposition based lévy flight artificial bee colony. Memetic Comp. 5, 213–227 (2013). https://doi.org/10.1007/s12293-012-0104-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12293-012-0104-0

Keywords

Search

Navigation