Skip to main content
SpringerLink
Log in

Centroid opposition with a two-point full crossover for the partially attracted firefly algorithm

  • Foundations
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

The firefly algorithm (FA) is a powerful optimization tool. However, the existing FA and its variants seldom take advantage of intermediate data generated during algorithm iteration. In this paper, the centroid opposition-based learning with a two-point full crossover (CCOBL) is proposed to make full use of the favor information of the candidate solutions. It adopts a centroid opposition computing for considering the search information of population and a two-point full crossover for using the favor information in the candidate solution and its opposite. Then, the CCOBL is incorporated into the partially attracted firefly algorithm. The proposed algorithm is tested on the CEC’ 2013 benchmark suite and a real-world optimization problem and is compared with some state-of-the-art FA algorithms and other up-to-date opposition-based evolutionary algorithms. The experimental results demonstrate the effectiveness of the CCOBL and the better performance of the proposed algorithm.

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
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Abdullah A, Deris S, Mohamad MS, Hashim SZM (2012) A new hybrid firefly algorithm for complex and nonlinear problem. In: DCAI, Springer, pp 673–680

    Google Scholar 

  • Abualigah LM, Khader AT (2017) Unsupervised text feature selection technique based on hybrid particle swarm optimization algorithm with genetic operators for the text clustering. J Supercomput 73(11):4773–4795. https://doi.org/10.1007/s11227-017-2046-2

    Article  Google Scholar 

  • Abualigah LM, Khader AT, Hanandeh ES, Gandomi AH (2017) A novel hybridization strategy for krill herd algorithm applied to clustering techniques. App Soft Comput 60:423–435. https://doi.org/10.1016/j.asoc.2017.06.059

    Article  Google Scholar 

  • Abualigah LM, Khader AT, Hanandeh ES (2018) A new feature selection method to improve the document clustering using particle swarm optimization algorithm. J Comput Sci 25:456–466. https://doi.org/10.1016/j.jocs.2017.07.018

    Article  Google Scholar 

  • Arabas J, Biedrzycki R (2017) Improving evolutionary algorithms in a continuous domain by monitoring the population midpoint. IEEE Trans Evol Comput 21:807–812

    Article  Google Scholar 

  • Arora S, Singh S (2013) The firefly optimization algorithm: convergence analysis and parameter selection. Int J Comput Appl 69(3):48–52

    Google Scholar 

  • Bolaji AL, Al-Betar MA, Awadallah MA, Khader AT, Abualigah LM (2016) A comprehensive review: Krill herd algorithm (kh) and its applications. Appl Soft Comput 49:437–446. https://doi.org/10.1016/j.asoc.2016.08.041

    Article  Google Scholar 

  • Cavicchio Jr DJ (1972) Reproductive adaptive plans. In: Proceedings of the ACM annual conference. ACM, vol 1, pp 60–70

  • 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, Nanyang Technological University, Kolkata

    Google Scholar 

  • Ergezer M, Simon D, Du D (2009) Oppositional biogeography-based optimization. IEEE International conference on systems, man and cybernetics. SMC 2009, IEEE, pp 1009–1014

  • Fister Jr I, Yang XS, Fister I, Brest J (2012) Memetic firefly algorithm for combinatorial optimization. arXiv preprint arXiv:12045165

  • Khadwilard A, Chansombat S, Thepphakorn T, Thapatsuwan P, Chainate W, Pongcharoen P (2012) Application of firefly algorithm and its parameter setting for job shop scheduling. J Ind Technol 8(1):49–58

    Google Scholar 

  • Liang J, Qu B, Suganthan P, Hernández-Díaz AG (2013) Problem definitions and evaluation criteria for the cec 2013 special session on real-parameter optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Nanyang Technological University, Singapore, Technical Report 201212:3–18

  • Rahnamayan S, Tizhoosh H, Salama M (2006) Opposition-based differential evolution for optimization of noisy problems. pp 1865–1872. https://doi.org/10.1109/CEC.2006.1688534

  • Rahnamayan S, Tizhoosh HR, SalamaMM (2007) Quasi-oppositional differential evolution. In: IEEE congress on evolutionary computation, 2007. CEC 2007. IEEE, pp 2229–2236

  • Rahnamayan S, Tizhoosh HR, Salama MM (2008) Opposition versus randomness in soft computing techniques. Appl Soft Comput 8(2):906–918

    Article  Google Scholar 

  • Rahnamayan S, Jesuthasan J, Bourennani F, Salehinejad H, Naterer GF (2014) Computing opposition by involving entire population. In: 2014 IEEE congress on evolutionary computation (CEC). IEEE, pp 1800–1807

  • Ram G, Mandal D, Kar R, Ghoshal SP (2017) Opposition-based bat algorithm for optimal design of circular and concentric circular arrays with improved far-field radiation characteristics. Int J Numer Model Electron Netw Devices Fields 30(3–4):e2087

    Article  Google Scholar 

  • Sahu RK, Panda S, Padhan S (2015) A hybrid firefly algorithm and pattern search technique for automatic generation control of multi area power systems. Int J Electr Power Energy Syst 64:9–23

    Article  Google Scholar 

  • Shehab M, Khader AT, Al-Betar MA, Abualigah LM (2017) Hybridizing cuckoo search algorithm with hill climbing for numerical optimization problems. In: 2017 8th International conference on information technology (ICIT). pp 36–43. https://doi.org/10.1109/ICITECH.2017.8079912

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

  • Verma OP, Aggarwal D, Patodi T (2016) Opposition and dimensional based modified firefly algorithm. Expert Syst Appl 44:168–176

    Article  Google Scholar 

  • Wang H, Li H, Liu Y, Li C, Zeng S (2007) Opposition-based particle swarm algorithm with cauchymutation. In: IEEE congress on evolutionary computation, 2007. CEC 2007. IEEE, pp 4750–4756

  • Wang H, Wu Z, Rahnamayan S, Liu Y, Ventresca M (2011) Enhancing particle swarm optimization using generalized opposition-based learning. Inf Sci 181(20):4699–4714

    Article  MathSciNet  Google Scholar 

  • Wang H, Wang W, Sun H (2015) Firefly algorithm with generalised opposition-based learning. Int J Wirel Mob Comput 9(4):370–376

    Article  Google Scholar 

  • Wang H, Wang W, Sun H, Rahnamayan S (2016) Firefly algorithm with random attraction. Int J Bio-Inspired Comput 8(1):33–41

    Article  Google Scholar 

  • Xu Q, Wang L, Wang N, Hei X, Zhao L (2014) A review of opposition-based learning from 2005 to 2012. Eng Appl Artif Intell 29:1–12

    Article  Google Scholar 

  • Yang XS (2009) Firefly algorithms for multimodal optimization. In: International symposium on stochastic algorithms. Springer, pp 169–178

  • Yang XS (2010) Nature-inspired metaheuristic algorithms. Luniver Press, Bristol

    Google Scholar 

  • Yang XS, He X (2013) Firefly algorithm: recent advances and applications. Int J Swarm Intell 1(1):36–50

    Article  Google Scholar 

  • Yu S, Su S, Lu Q, Huang L (2014) A novel wise step strategy for firefly algorithm. Int J Comput Math 91(12):2507–2513

    Article  MathSciNet  Google Scholar 

  • Yu S, Zhu S, Ma Y, Mao D (2015a) Enhancing firefly algorithm using generalized opposition-based learning. Computing 97(7):741–754

    Article  MathSciNet  Google Scholar 

  • Yu S, Zhu S, Ma Y, Mao D (2015b) A variable step size firefly algorithm for numerical optimization. Appl Math Comput 263:214–220

    MathSciNet  MATH  Google Scholar 

  • Zhou L, Ding L, Qiang X, Luo Y (2015) An improved discrete firefly algorithm for the traveling salesman problem. J Comput Theor Nanosci 12(7):1184–1189

    Article  Google Scholar 

  • Zhou L, Ding L, Ma M, Wan T (2018) An accurate partially attracted firefly algorithm. Computing. https://doi.org/10.1007/s00607-018-0645-2

    Article  Google Scholar 

Download references

Acknowledgements

The authors thank the Chinese National Natural Science Foundation (No. 61379059) and the Fundamental Research Funds for the Central Universities, South-Central University for Nationalities (No. CZY18012) for financial support for this work.

Author information

Authors and Affiliations

  1. College of Computer Science, South-Central University for Nationalities, Wuhan, 430074, Hubei, China

    Lingyun Zhou & Wan Tang

  2. Computer School, Wuhan University, Wuhan, 430072, Hubei, China

    Lingyun Zhou & Lixin Ding

  3. School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore

    Maode Ma

Authors
  1. Lingyun Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maode Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lixin Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wan Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lingyun Zhou.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interests regarding the publication of this paper.

Ethical approval

This manuscript dose not contain any studies with human participants or animals performed by any of the authors.

Informed consent

Informed consent was obtained from all authors included in the study.

Additional information

Communicated by A. Di Nola.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, L., Ma, M., Ding, L. et al. Centroid opposition with a two-point full crossover for the partially attracted firefly algorithm. Soft Comput 23, 12241–12254 (2019). https://doi.org/10.1007/s00500-019-04221-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-019-04221-x

Keywords

Search

Navigation