Skip to main content

Advertisement

Springer Nature Link
Log in

An improved brainstorm optimization using chaotic opposite-based learning with disruption operator for global optimization and feature selection

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Optimization has increased its use in different domains for accurately solving challenging problems. Complex optimization problems require the use of methods that possess the capabilities to properly explore the search spaces. The traditional algorithms commonly tend to fail in suboptimal values during the optimization process; this fact affects the quality of the solutions. This situation occurs for different reasons, but the lack of diversity due to the use of exploitation operators is the most common. Brainstorm optimization is an alternative method based on the social strategy to generate new innovative ideas in work groups. In brainstorm optimization, each solution representing an idea and brainstorm process is performed using clustering algorithms. However, brainstorm optimization is not able to thoroughly explore the search space, and its diversity is reduced. It does not possess any mechanism to escape from suboptimal solutions. Besides, the computational effort is also increased in the iterative process. This paper presents a modified version of brainstorm optimization that improves its performance. In the proposed algorithm, chaotic maps and opposition-based learning are applied to initialize the solutions for a given problem. Moreover, in the optimization process, the positions of the initial population are updated using the disruptor operator. After updating the population, opposition-based learning is used again to analyze the opposite solutions. The combination of chaotic maps, opposition-based learning and disruption operator improve the exploration ability of brainstorm optimization by increasing the diversity of the population. The proposed method has been evaluated using a set of benchmark functions, and it has been also used for feature selection in data mining. The results show the high efficacy of the proposed method to determine the optimal solutions of the tested functions.

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
$34.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 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
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Explore related subjects

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

References

  • Abd ElAziz M, Oliva D, Xiong S (2017) An improved opposition-based sine cosine algorithm for global optimization. Exp Syst Appl 90:484–500

    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:4773–4795

    Google Scholar 

  • Abualigah LM, Khader AT, Hanandeh ES (2018a) A combination of objective functions and hybrid krill herd algorithm for text document clustering analysis. Eng Appl Artif Intell 73:111–125

    Google Scholar 

  • Abualigah LM, Khader AT, Hanandeh ES (2018b) Hybrid clustering analysis using improved krill herd algorithm. Appl Intell 48:4047–4071

    Google Scholar 

  • Abualigah LM, Khader AT, Hanandeh ES (2018c) A new feature selection method to improve the document clustering using particle swarm optimization algorithm. J Comput Sci 25:456–466

    Article  Google Scholar 

  • Abualigah LMQ (2019) Feature selection and enhanced krill herd algorithm for text document clustering. Springer, Berlin

    Google Scholar 

  • Abualigah LMQ, Hanandeh ES (2015) Applying genetic algorithms to information retrieval using vector space model. Int J Comput Sci Eng Appl 5:19

    Google Scholar 

  • Aguirregabiria JM (2009) Robust chaos with variable Lyapunov exponent in smooth one-dimensional maps. Chaos Solitons Fractals 42:2531–2539

    MATH  Google Scholar 

  • Ahmadi S-A (2017) Human behavior-based optimization: a novel metaheuristic approach to solve complex optimization problems. Neural Comput Appl 28:233–244

    Google Scholar 

  • Cao Z, Hei X, Wang L, Shi Y, Rong X (2015) An improved brain storm optimization with differential evolution strategy for applications of ANNs. Math Prob Eng. https://doi.org/10.1155/2015/923698

    Article  Google Scholar 

  • Chen J, Cheng S, Chen Y, Xie Y, Shi Y (2015) Enhanced brain storm optimization algorithm for wireless sensor networks deployment. In: Advances in swarm and computational intelligence, Lecture notes in computer science, vol 9140. pp 373–381

  • Chen J, Xie Y, Ni J (2014) Brain storm optimization model based on uncertainty information. In: 2014 Tenth international conference on computational intelligence and security (CIS). IEEE, pp 99–103

  • Cuevas E, Oliva D, Zaldivar D, Perez-Cisneros M, Pajares G (2012) Opposition-based electromagnetism-like for global optimization. Int J Innov Comput Inf Control 8:8181–8198

    Google Scholar 

  • Deng W, Xu J, Zhao H (2019) An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. IEEE Access 7:20281–20292

    Google Scholar 

  • Deng W, Zhao H, Yang X, Xiong J, Sun M, Li B (2017a) Study on an improved adaptive pso algorithm for solving multi-objective gate assignment. Appl Soft Comput 59:288–302

    Google Scholar 

  • Deng W, Zhao H, Zou L, Li G, Yang X, Wu D (2017b) A novel collaborative optimization algorithm in solving complex optimization problems. Soft Comput 21:4387–4398

    Google Scholar 

  • El Aziz MA, Hassanien AE (2018) An improved social spider optimization algorithm based on rough sets for solving minimum number attribute reduction problem. Neural Comput Appl 30(8):2441–2452

    Google Scholar 

  • Ewees AA, El Aziz MA, Hassanien AE (2019) Chaotic multi-verse optimizer-based feature selection. Neural Comput Appl 31(4):991–1006

    Google Scholar 

  • Frank A, Asuncion A (2010) Uci machine learning repository (http://archive.ics.uci.edu/ml). Irvine, ca: University of california. School of information and computer science 213: 2–2

  • Goldberg D (1989) Genetic algorithms in search, optimization, and machine learning, 1st edn. Addison-Wesley, Boston

    MATH  Google Scholar 

  • Harwit M (2006) Astrophysical concepts. Springer, Berlin

    MATH  Google Scholar 

  • Jadhav H, Sharma U, Patel J, Roy R (2012) Brain storm optimization algorithm based economic dispatch considering wind power. In: 2012 IEEE International conference on power and energy (PECon). IEEE, pp 588–593

  • Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report TR06, Comput. Eng. Dep. Eng. Fac. Erciyes Univ

  • Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: IEEE proceedings of international conference on neural networks, vol 4. pp 1942–1948

  • Krishnanand K, Hasani SMF, Panigrahi BK, Panda SK (2013) Optimal power flow solution using self–evolving brain–storming inclusive teaching–learning–based algorithm. In: International conference in swarm intelligence. Springer, pp 338–345

  • Labani M, Moradi P, Ahmadizar F, Jalili M (2018) A novel multivariate filter method for feature selection in text classification problems. Eng Appl Artif Intell 70:25–37

    Google Scholar 

  • Lee KS, Geem ZW (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Methods Appl Mech Eng 194:3902–3933

    MATH  Google Scholar 

  • Liu H, Ding G, Wang B (2014) Bare-bones particle swarm optimization with disruption operator. Appl Math Comput 238:106–122

    MathSciNet  MATH  Google Scholar 

  • Mirjalili S (2015) Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl Based Syst 89:228–249

    Google Scholar 

  • Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H, Mirjalili SM (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163–191

    Google Scholar 

  • Mirjalili S, Mirjalili SM, Hatamlou A (2016) Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput Appl 27:495–513

    Google Scholar 

  • Sarafrazi S, Nezamabadi-Pour H, Saryazdi S (2011) Disruption: a new operator in gravitational search algorithm. Scientia Iranica 18:539–548

    Google Scholar 

  • Shi Y (2011) Brain storm optimization algorithm, vol 6728. LNCS, Berlin, pp 303–309

    Google Scholar 

  • Shi Y (2015) Brain storm optimization algorithm in objective space. In: 2015 IEEE congress on evolutionary computation (CEC). IEEE, pp 1227–1234

  • Suganthan PN, Hansen N, Liang JJ, Deb K, Chen Y-P, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL Rep 2005005:2005

    Google Scholar 

  • Tian G, Zhang H, Feng Y, Wang D, Peng Y, Jia H (2018a) Green decoration materials selection under interior environment characteristics: a grey-correlation based hybrid MCDM method. Renew Sustain Energy Rev 81:682–692

    Google Scholar 

  • Tian G, Zhou M, Li P (2018b) Disassembly sequence planning considering fuzzy component quality and varying operational cost. IEEE Trans Autom Sci Eng 15:748–760

    Google Scholar 

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

  • Wilcoxon F (1945) Individual comparisons by ranking methods. Biom Bull 1:80–83

    Google Scholar 

  • Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1:67–82

    Google Scholar 

  • Yang D, Li G, Cheng G (2007) On the efficiency of chaos optimization algorithms for global optimization. Chaos Solitons Fractals 34:1366–1375

    MathSciNet  Google Scholar 

  • Yang Z, Shi Y (2015) Brain storm optimization with chaotic operation. In: 2015 seventh international conference on advanced computational intelligence (ICACI). IEEE, pp 111–115

  • Zhan Z-h, Chen W-n, Lin Y, Gong Y-j, Li Y-l, Zhang J (2013) Parameter investigation in brain storm optimization. In: 2013 IEEE symposium on swarm intelligence (SIS). IEEE, pp 103–110

  • Zhao H, Zheng J, Xu J, Deng W (2019) Fault diagnosis method based on principal component analysis and broad learning system. IEEE Access 7:99263–99272

    Google Scholar 

  • Zhou D, Shi Y, Cheng S (2012) Brain storm optimization algorithm with modified step-size and individual generation. In: International conference in swarm intelligence. Springer, pp 243–252

Download references

Author information

Authors and Affiliations

  1. Departamento de Ciencias Computacionales, Universidad de Guadalajara, CUCEI Av. Revolucion 1500, Guadalajara, Jal, Mexico

    Diego Oliva

  2. Department of Mathematics, Faculty of Science, Zagazig University, Zagazig, Egypt

    Mohamed Abd Elaziz

Authors
  1. Diego Oliva
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Mohamed Abd Elaziz
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Diego Oliva.

Ethics declarations

Conflict of interest

It is to specifically state that “no competing interest are at stake and there is no conflict of interest” with other people or organizations that could inappropriately influence or bias the content of the paper.

Financial or personal relationship

None of the authors of this paper has a financial or personal relationship with other people or organizations that could inappropriately influence or bias the content of the paper.

Human participants or animals

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

Additional information

Communicated by V. Loia.

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

Oliva, D., Elaziz, M.A. An improved brainstorm optimization using chaotic opposite-based learning with disruption operator for global optimization and feature selection. Soft Comput 24, 14051–14072 (2020). https://doi.org/10.1007/s00500-020-04781-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-04781-3

Keywords