iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/S11047-020-09811-5
Improvement in learning enthusiasm-based TLBO algorithm with enhanced exploration and exploitation properties | Natural Computing Skip to main content
Springer Nature Link
Log in

Improvement in learning enthusiasm-based TLBO algorithm with enhanced exploration and exploitation properties

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

Learning enthusiasm-based Teaching Learning Based Optimization (LebTLBO) is a metaheuristic inspired by the classroom teaching and learning method of TLBO. In recent years, it has been effectively used in several applications of science and engineering. In the conventional TLBO and most of its versions, all the learners have the same probability of getting knowledge from others. LebTLBO is motivated by the different probabilities of acquiring knowledge by the learner from others and introduced a learning enthusiasm mechanism into the basic TLBO. In this work, to achieve the enhanced performance of conventional LebTLBO by balancing the exploration and exploitation capabilities, an improved LebTLBO algorithm is proposed. The exploration of LebTLBO has been enhanced by the incorporation of the Opposition Based Learning strategy. Exploitation has been improved by Local Neighborhood Search inspired by the experience of the best solution so far discovered in a local neighborhood of the present solution. On the CEC2019 benchmark functions, the suggested technique is assessed, and computational findings show that it provides promising outcomes over other algorithms. Finally, improved LebTLBO is employed in three engineering problems and the competitive findings demonstrate its potential for a real-world problem such as the localization problem in Wireless Sensor Networks.

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
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25
Fig. 26

Similar content being viewed by others

Explore related subjects

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

Abbreviations

ABC:

Artificial Bee Colony Algorithm

ACO:

Ant Colony Optimization

AoA:

Angle of Arrival

BA:

Bat Algorithm

BBO:

Biogeography Based Optimization Algorithm

CS:

Cuckoo Search Algorithm

DA:

Dragonfly Algorithm

EAs:

Evolutionary Algorithms

EOBL:

Elite Opposition-Based Learning

FA:

Firefly Algorithm

FPA:

Flower Pollination Algorithm

GA:

Genetic Algorithm

LebTLBO:

Learning enthusiasm-based TLBO

LNS:

Local Neighborhood Search

NBA:

Novel Bat Algorithm

NMRA:

Naked Mole Rat Algorithm

OBL:

Opposition Based Learning strategy

PSO:

Particle Swarm Optimization

RSSI:

Received Signal Strength Indicator

SI:

Swarm Intelligence

SMO:

Spider Monkey Optimization Algorithm

TDoA:

Time Difference of Arrival

TLBO:

Teaching Learning Based Optimization

ToA:

Time of Arrival

WSNs:

Wireless Sensor Networks

WWO:

Water Wave Optimization Algorithm

References

  • Abramowitz M (1974) Handbook of mathematical functions, with formulas, graphs, and mathematical tables. Dover Publications Inc, New York, NY

    MATH  Google Scholar 

  • Bansal JC, Sharma H, Jadon SS, Clerc M (2014) Spider monkey optimization algorithm for numerical optimization. Mem Comput 6(1):31–47

    Article  Google Scholar 

  • Biswas S, Kundu S, Bose D, Das S (2012) Cooperative coevolutionary teaching-learning based algorithm with a modified exploration strategy for large scale global optimization. In: Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): preface, vol 7677, pp 467–475

  • Blum C, Li X (2008) Swarm intelligence in optimization. In: Blum C, Merkle D (eds) Swarm intelligence: introduction and applications. Springer, Berlin, pp 43–85

    Chapter  Google Scholar 

  • Chen D, Lu R, Zou F, Li S (2016) Teaching-learning-based optimization with variable population scheme and its application for ANN and global optimization. Neurocomputing 173:1096–1111

    Article  Google Scholar 

  • Chen X, Mei C, Xu B, Yu K, Huang X (2018a) Quadratic interpolation based teaching learning-based optimization for chemical dynamic system optimization. Knowl-Based Syst 145:250–263

    Article  Google Scholar 

  • Chen Xu, Bin Xu, Kunjie Yu, Wenli Du (2018b) Teaching-learning-based optimization with learning enthusiasm mechanism and its application in chemical engineering. J Appl Math. https://doi.org/10.1155/2018/1806947

    Article  MATH  Google Scholar 

  • Črepinšek M, Liu SH, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv 45(3):35

    Article  Google Scholar 

  • Das S, Abraham A, Chakraborty UK, Konar A (2009) Differential evolution using a neighborhood-based mutation operator. IEEE Trans Evol Comput 13(3):526–553

    Article  Google Scholar 

  • Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28–39

    Article  Google Scholar 

  • Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32:674–701

    Article  Google Scholar 

  • Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11:86–92

    Article  MathSciNet  Google Scholar 

  • Garg H (2016) A hybrid PSO-GA algorithm for constrained optimization problems. Appl Math Comput 274:292–305

    MathSciNet  MATH  Google Scholar 

  • Janez B, Mirjam M, Borko SB (2019) The 100-digit challenge: algorithm, pp 19–26

  • Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Global Optim 39:459–471

    Article  MathSciNet  Google Scholar 

  • Keesari HS, Rao RV (2013) Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm. OPSEARCH 51(4):545–561

    Article  MathSciNet  Google Scholar 

  • Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN’95-international conference on neural networks, vol 4. IEEE, pp 1942–1948

  • Li Z, Wang W, Yan Y, Li Z (2015) PS-ABC: a hybrid algorithm based on particle swarm and artificial bee colony for high-dimensional optimization problems. Expert Syst Appl 42(22):8881–8895

    Article  Google Scholar 

  • Maesani A, Iacca G, Floreano D (2016) Memetic viability evolution for constrained optimization. IEEE Trans Evol Comput 20(1):125–144. https://doi.org/10.1109/TEVC.2015.2428292

    Article  Google Scholar 

  • Mirjalili S (2016) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput Appl 27:1053–1073

    Article  Google Scholar 

  • Nabil E (2016) A modified flower pollination algorithm for global optimization. Expert Syst Appl 57:192–203

    Article  Google Scholar 

  • Nasir A, Tokhi M, Ghani N (2015) Novel adaptive bacterial foraging algorithms for global optimisation with application to modelling of a trs. Expert Syst Appl 42(3):1513–1530

    Article  Google Scholar 

  • Niknam T, Golestaneh F, Sadeghi MS (2012) θ-Multiobjective teaching-learning-based optimization for dynamic economic emission dispatch. IEEE Syst J 6(2):341–352

    Article  Google Scholar 

  • Patel VK, Savsani VJ (2016) A multi-objective improved teaching-learning based optimization algorithm (MOITLBO). Inf Sci 357:182–200

    Article  Google Scholar 

  • 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–15

    Article  MathSciNet  Google Scholar 

  • Salgotra R, Singh U (2019) The naked mole-rat algorithm. Neural Comput Appl 7:8837

    Article  Google Scholar 

  • Senthilnath J, Omkar SN, Mani V (2011) Clustering using firefly algorithm: performance study. Swarm Evolut Comput 1(3):164–171

    Article  Google Scholar 

  • Singh P, Mittal N (2020) An efficient localization approach for WSNs using hybrid DA-FA algorithm. IET Commun 14(12):1975–1991. https://doi.org/10.1049/iet-com.2019.1311

    Article  Google Scholar 

  • Singh P, Khosla A, Kumar A, Khosla M (2018) Optimized localization of target nodes using single mobile anchor node in wireless sensor network. AEU-Int J Electron Commun 91:55–65

    Article  Google Scholar 

  • Whitley D (1994) A genetic algorithm tutorial. Stat Comput 4(2):65–85

    Article  Google Scholar 

  • Wu X, Zhou Y, Lu Y (2017) Elite opposition-based water wave optimization algorithm for global optimization. Math Probl Eng 2017, Article ID 3498363

  • Yang XS (2014) Nature-inspired optimization algorithms, pp 1–21

  • Yang XS, Deb S (2009) Cuckoo search via Lévy flights. In: 2009 world congress on nature & biologically inspired computing (NaBIC). IEEE, pp 210–214

  • Yang XS, Gandomi AH (2012) Bat algorithm: a novel approach for global engineering optimization. Eng Comput 29(5):464–483

    Article  Google Scholar 

  • Zheng YJ, Zhang B (2015) A simplified water wave optimization algorithm. In: 2015 IEEE congress on evolutionary computation (CEC). IEEE, pp 807–813

Download references

Author information

Authors and Affiliations

  1. Department of Electronics and Communication Engineering, Chandigarh University, Mohali, Punjab, 140413, India

    Nitin Mittal, Arpan Garg, Prabhjot Singh, Simrandeep Singh & Harbinder Singh

Authors
  1. Nitin Mittal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arpan Garg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Prabhjot Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Simrandeep Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Harbinder Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nitin Mittal.

Additional information

Publisher's Note

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

Appendix

Appendix

See Table 10.

Table 10 The 100-digit challenge basic test functions (Salgotra and Singh 2019)
Full size table

Algorithm 1.

Pseudo code of TLBO

figure a

Algorithm 2.

Pseudo code of LebTLBO

figure b

Algorithm 3.

Pseudo code of LebTV 1.0

figure c

Algorithm 4.

Pseudo code of LebTV 2.0

figure d

Algorithm 5.

Pseudo code of LebTV 3.0

figure e

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mittal, N., Garg, A., Singh, P. et al. Improvement in learning enthusiasm-based TLBO algorithm with enhanced exploration and exploitation properties. Nat Comput 20, 577–609 (2021). https://doi.org/10.1007/s11047-020-09811-5

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-020-09811-5

Keywords

Search

Navigation