Skip to main content
Erschienen in: International Journal of Machine Learning and Cybernetics 6/2019

17.04.2018 | Original Article

A modified teaching–learning-based optimization algorithm for numerical function optimization

verfasst von: Peifeng Niu, Yunpeng Ma, Shanshan Yan

Erschienen in: International Journal of Machine Learning and Cybernetics | Ausgabe 6/2019

Einloggen

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, a kind of modified teaching–learning-based optimization algorithm (MTLBO) is proposed to enhance the solution quality and accelerate the convergence speed of the conventional TLBO. Compared with TLBO, the MTLBO algorithm possesses different updating mechanisms of the individual solution. In teacher phase of the MTLBO, the students are divided into two groups according to the mean result of learners in all subjects. Moreover, the two groups present different updating strategies of the solution. In learner phase, the students are still divided into two groups, where the first group includes the top half of the students and the second group contains the remaining students. The first group members increase their knowledge through interaction among themselves and study independently. The second group members increase their marks relying on their teacher. According to the above-mentioned updating mechanisms, the MTLBO can provide a good balance between the exploratory and exploitative capabilities. Performance of the proposed MTLBO algorithm is evaluated by 23 unconstrained numerical functions and 28 CEC2017 benchmark functions. Compared with TLBO and other several state-of-the-art optimization algorithms, the results indicate that the MTLBO shows better solution quality and faster convergence speed.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Weitere Produktempfehlungen anzeigen
Literatur
1.
Zurück zum Zitat Rao RV, Savsani VJ, Vakharia DP (2012) Teaching–learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf Sci 183(1):1–15MathSciNetCrossRef Rao RV, Savsani VJ, Vakharia DP (2012) Teaching–learning-based optimization: an optimization method for continuous non-linear large scale problems. Inf Sci 183(1):1–15MathSciNetCrossRef
2.
Zurück zum Zitat Doğan B, Ölmez T (2015) A new metaheuristic for numerical function optimization: vortex search algorithm. Inf Sci 293:125–145CrossRef Doğan B, Ölmez T (2015) A new metaheuristic for numerical function optimization: vortex search algorithm. Inf Sci 293:125–145CrossRef
3.
Zurück zum Zitat Kennedy J. Particle swarm optimization[M]//encyclopedia of machine learning. Springer US, 2010: 760–766 Kennedy J. Particle swarm optimization[M]//encyclopedia of machine learning. Springer US, 2010: 760–766
4.
Zurück zum Zitat Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459–471MathSciNetCrossRefMATH Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459–471MathSciNetCrossRefMATH
5.
Zurück zum Zitat Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248CrossRefMATH Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Inf Sci 179(13):2232–2248CrossRefMATH
6.
Zurück zum Zitat Gandomi AH, Alavi AH (2012) Krill herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17(12):4831–4845MathSciNetCrossRefMATH Gandomi AH, Alavi AH (2012) Krill herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17(12):4831–4845MathSciNetCrossRefMATH
7.
Zurück zum Zitat Cuevas E, Cienfuegos M, Zaldívar D et al (2013) A swarm optimization algorithm inspired in the behavior of the social-spider. Expert Syst Appl 40(16):6374–6384CrossRef Cuevas E, Cienfuegos M, Zaldívar D et al (2013) A swarm optimization algorithm inspired in the behavior of the social-spider. Expert Syst Appl 40(16):6374–6384CrossRef
8.
Zurück zum Zitat Mirjalili SSCA. (2016) A Sine Cosine Algorithm for solving optimization problems. Knowl Based Syst 96:120–133CrossRef Mirjalili SSCA. (2016) A Sine Cosine Algorithm for solving optimization problems. Knowl Based Syst 96:120–133CrossRef
9.
Zurück zum Zitat Rao RV, Savsani VJ, Vakharia DP (2011) Teaching–learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303–315CrossRef Rao RV, Savsani VJ, Vakharia DP (2011) Teaching–learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303–315CrossRef
10.
Zurück zum Zitat Li G, Niu P, Xiao X (2012) Development and investigation of efficient artificial bee colony algorithm for numerical function optimization. Appl Soft Comput 12(1):320–332CrossRef Li G, Niu P, Xiao X (2012) Development and investigation of efficient artificial bee colony algorithm for numerical function optimization. Appl Soft Comput 12(1):320–332CrossRef
11.
Zurück zum Zitat Mernik M, Liu SH, Karaboga D et al (2015) On clarifying misconceptions when comparing variants of the Artificial Bee Colony Algorithm by offering a new implementation. Inf Sci 291:115–127MathSciNetCrossRefMATH Mernik M, Liu SH, Karaboga D et al (2015) On clarifying misconceptions when comparing variants of the Artificial Bee Colony Algorithm by offering a new implementation. Inf Sci 291:115–127MathSciNetCrossRefMATH
12.
Zurück zum Zitat Petrović M, Vuković N, Mitić M et al (2016) Integration of process planning and scheduling using chaotic particle swarm optimization algorithm. Expert Syst Appl 64:569–588CrossRef Petrović M, Vuković N, Mitić M et al (2016) Integration of process planning and scheduling using chaotic particle swarm optimization algorithm. Expert Syst Appl 64:569–588CrossRef
13.
Zurück zum Zitat Mandal B, Roy PK, Mandal S (2014) Economic load dispatch using krill herd algorithm. Int J Electr Power Energy Syst 57:1–10CrossRef Mandal B, Roy PK, Mandal S (2014) Economic load dispatch using krill herd algorithm. Int J Electr Power Energy Syst 57:1–10CrossRef
14.
Zurück zum Zitat Niu P, Ma Y, Li M et al (2016) A kind of parameters self-adjusting extreme learning machine. Neural Process Lett 44(3):813–830CrossRef Niu P, Ma Y, Li M et al (2016) A kind of parameters self-adjusting extreme learning machine. Neural Process Lett 44(3):813–830CrossRef
15.
Zurück zum Zitat Ghasemi M, Ghavidel S, Rahmani S et al (2014) A novel hybrid algorithm of imperialist competitive algorithm and teaching learning algorithm for optimal power flow problem with non-smooth cost functions. Eng Appl Artif Intell 29:54–69CrossRef Ghasemi M, Ghavidel S, Rahmani S et al (2014) A novel hybrid algorithm of imperialist competitive algorithm and teaching learning algorithm for optimal power flow problem with non-smooth cost functions. Eng Appl Artif Intell 29:54–69CrossRef
16.
Zurück zum Zitat Niknam T, Fard AK, Baziar A (2012) Multi-objective stochastic distribution feeder reconfiguration problem considering hydrogen and thermal energy production by fuel cell power plants. Energy 42(1):563–573CrossRef Niknam T, Fard AK, Baziar A (2012) Multi-objective stochastic distribution feeder reconfiguration problem considering hydrogen and thermal energy production by fuel cell power plants. Energy 42(1):563–573CrossRef
17.
Zurück zum Zitat Niknam T, Azizipanah-Abarghooee R, Narimani MR (2012) An efficient scenario-based stochastic programming framework for multi-objective optimal micro-grid operation. Appl Energy 99:455–470CrossRef Niknam T, Azizipanah-Abarghooee R, Narimani MR (2012) An efficient scenario-based stochastic programming framework for multi-objective optimal micro-grid operation. Appl Energy 99:455–470CrossRef
18.
Zurück zum Zitat Niknam T, Azizipanah-Abarghooee R, Narimani MR (2012) A new multi objective optimization approach based on TLBO for location of automatic voltage regulators in distribution systems. Eng Appl Artif Intell 25(8):1577–1588CrossRef Niknam T, Azizipanah-Abarghooee R, Narimani MR (2012) A new multi objective optimization approach based on TLBO for location of automatic voltage regulators in distribution systems. Eng Appl Artif Intell 25(8):1577–1588CrossRef
19.
Zurück zum Zitat Niknam T, Golestaneh F, Sadeghi MS (2012) θ-Multiobjective teaching–learning-based optimization for dynamic economic emission dispatch. Syst J IEEE 6(2):341–352CrossRef Niknam T, Golestaneh F, Sadeghi MS (2012) θ-Multiobjective teaching–learning-based optimization for dynamic economic emission dispatch. Syst J IEEE 6(2):341–352CrossRef
20.
Zurück zum Zitat Rao RV, Kalyankar VD (2013) Parameter optimization of modern machining processes using teaching–learning-based optimization algorithm. Eng Appl Artif Intell 26(1):524–531CrossRef Rao RV, Kalyankar VD (2013) Parameter optimization of modern machining processes using teaching–learning-based optimization algorithm. Eng Appl Artif Intell 26(1):524–531CrossRef
21.
Zurück zum Zitat Rao RV, Kalyankar VD (2012) Multi-objective multi-parameter optimization of the industrial LBW process using a new optimization algorithm. Proc Inst Mech Eng Part B J Eng Manuf 226(6):1018–1025CrossRef Rao RV, Kalyankar VD (2012) Multi-objective multi-parameter optimization of the industrial LBW process using a new optimization algorithm. Proc Inst Mech Eng Part B J Eng Manuf 226(6):1018–1025CrossRef
22.
Zurück zum Zitat Krishnanand KR, Panigrahi BK, Rout PK et al (2011) Application of multi-objective teaching–learning-based algorithm to an economic load dispatch problem with incommensurable objectives[M]//swarm, evolutionary, and memetic computing. Springer, Berlin, pp 697–705 Krishnanand KR, Panigrahi BK, Rout PK et al (2011) Application of multi-objective teaching–learning-based algorithm to an economic load dispatch problem with incommensurable objectives[M]//swarm, evolutionary, and memetic computing. Springer, Berlin, pp 697–705
23.
Zurück zum Zitat Li G, Niu P, Zhang W et al (2013) Model NOx emissions by least squares support vector machine with tuning based on ameliorated teaching–learning-based optimization. Chemometr Intell Lab Syst 126:11–20CrossRef Li G, Niu P, Zhang W et al (2013) Model NOx emissions by least squares support vector machine with tuning based on ameliorated teaching–learning-based optimization. Chemometr Intell Lab Syst 126:11–20CrossRef
24.
Zurück zum Zitat Rao R, Patel V (2013) Comparative performance of an elitist teaching–learning-based optimization algorithm for solving unconstrained optimization problems. Int J Ind Eng Comput 4(1):29–50 Rao R, Patel V (2013) Comparative performance of an elitist teaching–learning-based optimization algorithm for solving unconstrained optimization problems. Int J Ind Eng Comput 4(1):29–50
25.
Zurück zum Zitat Rao RV, Patel V (2013) An improved teaching–learning-based optimization algorithm for solving unconstrained optimization problems. Scientia Iranica 20(3):710–720 Rao RV, Patel V (2013) An improved teaching–learning-based optimization algorithm for solving unconstrained optimization problems. Scientia Iranica 20(3):710–720
26.
Zurück zum Zitat Roy PK, Bhui S (2013) Multi-objective quasi-oppositional teaching learning based optimization for economic emission load dispatch problem. Int J Electr Power Energy Syst 53:937–948CrossRef Roy PK, Bhui S (2013) Multi-objective quasi-oppositional teaching learning based optimization for economic emission load dispatch problem. Int J Electr Power Energy Syst 53:937–948CrossRef
27.
Zurück zum Zitat Črepinšek M, Liu SH, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv 45(3):35MATH Črepinšek M, Liu SH, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv 45(3):35MATH
28.
Zurück zum Zitat Awad NH, Ali MZ, Liang JJ, Qu BY, Suganthan PN (2016) Problem definitions and evaluation criteria for the CEC2017 special session and competition on single objective bound constrained real-parameter numerical optimization, Technical Report, Nanyang Technological University, Singapore Awad NH, Ali MZ, Liang JJ, Qu BY, Suganthan PN (2016) Problem definitions and evaluation criteria for the CEC2017 special session and competition on single objective bound constrained real-parameter numerical optimization, Technical Report, Nanyang Technological University, Singapore
Metadaten
Titel
A modified teaching–learning-based optimization algorithm for numerical function optimization
verfasst von
Peifeng Niu
Yunpeng Ma
Shanshan Yan
Publikationsdatum
17.04.2018
Verlag
Springer Berlin Heidelberg
Erschienen in
International Journal of Machine Learning and Cybernetics / Ausgabe 6/2019
Print ISSN: 1868-8071
Elektronische ISSN: 1868-808X
DOI
https://doi.org/10.1007/s13042-018-0815-8

Weitere Artikel der Ausgabe 6/2019

International Journal of Machine Learning and Cybernetics 6/2019 Zur Ausgabe