The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Teaching–learning-based optimization algorithm for unconstrained and constrained real-parameter optimization problems
Abstract
An efficient optimization algorithm called teaching–learning-based optimization (TLBO) is proposed in this article to solve continuous unconstrained and constrained optimization problems. The proposed method is based on the effect of the influence of a teacher on the output of learners in a class. The basic philosophy of the method is explained in detail. The algorithm is tested on 25 different unconstrained benchmark functions and 35 constrained benchmark functions with different characteristics. For the constrained benchmark functions, TLBO is tested with different constraint handling techniques such as superiority of feasible solutions, self-adaptive penalty, ϵ-constraint, stochastic ranking and ensemble of constraints. The performance of the TLBO algorithm is compared with that of other optimization algorithms and the results show the better performance of the proposed algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
GSA: A Gravitational Search Algorithm
Rashedi, E., Nezamabadi-pour, H., & Saryazdi, S. (2009) · Information Sciences · doi:10.1016/j.ins.2009.03.004 · Cited by 7,358
A New Heuristic Optimization Algorithm: Harmony Search
Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001) · SIMULATION · doi:10.1177/003754970107600201 · Cited by 6,247
AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION
Karaboğa, D. (2005) · Cited by 5,466
Rao, R. V., Savsani, V. J., & Vakharia, D. P. (2011) · Computer-Aided Design · doi:10.1016/j.cad.2010.12.015 · Cited by 5,150
Self-citationBiogeography-Based Optimization
Simon, D. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.919004 · Cited by 4,305
An efficient constraint handling method for genetic algorithms
Deb, K. (2000) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(99)00389-8 · Cited by 3,892
Optimization, Learning and Natural Algorithms
Dorigo, M. (1992) · Medical Entomology and Zoology · Cited by 3,307
Biomimicry of bacterial foraging for distributed optimization and control
(2002) · IEEE Control Systems · doi:10.1109/mcs.2002.1004010 · Cited by 3,069
(2005) · Cited by 2,565
Multiobjective evolutionary algorithms: A survey of the state of the art
Zhou, A., Qu, B.-Y., Li, H., Zhao, S.-Z., Suganthan, P. N., & Zhang, Q. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.03.001 · Cited by 2,255
Stochastic ranking for constrained evolutionary optimization
Runarsson, T. P., & Yao, X. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.873238 · Cited by 1,807
Rao, R. V., Savsani, V. J., & Vakharia, D. P. (2012) · Information Sciences · doi:10.1016/j.ins.2011.08.006 · Cited by 1,792
Self-citationOptimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm
Eusuff, M. M., & Lansey, K. E. (2003) · Journal of Water Resources Planning and Management · doi:10.1061/(asce)0733-9496(2003)129:3(210 · Cited by 1,390
Self-adaptive Differential Evolution Algorithm for Numerical Optimization
Qin, A. K., & Suganthan, P. N. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554904 · Cited by 1,215
A modified Artificial Bee Colony algorithm for real-parameter optimization
Akay, B., & Karaboğa, D. (2010) · Information Sciences · doi:10.1016/j.ins.2010.07.015 · Cited by 1,174
The immune system, adaptation, and machine learning
Farmer, J. D., Packard, N. H., & Perelson, A. S. (1986) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(86)90240-x · Cited by 1,087
The decay of turbulence in the burgers model
Moiseev, S. S., Toor, A. V., & Yanovsky, V. V. (1981) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(81)90072-5 · Cited by 1,045
A Restart CMA Evolution Strategy With Increasing Population Size
Auger, A., & Hansen, N. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554902 · Cited by 952
Real-Parameter Optimization with Differential Evolution
Ronkkonen, J., Kukkonen, S., & Price, K. V. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554725 · Cited by 566
Search Biases in Constrained Evolutionary Optimization
Runarsson, T. P., & Yao, X. (2005) · IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2004.841906 · Cited by 468
Ensemble of Constraint Handling Techniques
Mallipeddi, R., & Suganthan, P. N. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2033582 · Cited by 467
Takahama, T., & Sakai, S. (2006) · 2006 IEEE International Conference on Evolutionary Computation · doi:10.1109/cec.2006.1688283 · Cited by 430
Real-parameter evolutionary multimodal optimization — A survey of the state-of-the-art
Das, S., Maity, S., Qu, B.-Y., & Suganthan, P. N. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.05.005 · Cited by 308
An Adaptive Tradeoff Model for Constrained Evolutionary Optimization
Wang, Y., Cai, Z., Zhou, Y., & Zeng, W. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.902851 · Cited by 302
Dynamic Multi-Swarm Particle Swarm Optimizer with Local Search
Liang, J. J., & Suganthan, P. N. (2005) · 2005 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2005.1554727 · Cited by 291
Wang, Y., Cai, Z., Guo, G., & Zhou, Y. (2007) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.886164 · Cited by 250
Cited by
Sultana, S., & Roy, P. K. (2014) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2014.06.031 · Cited by 331
Metadata
- Authors
- Rao, R. V., Savsani, V. J., & Balic, J.
- Venue
- Engineering Optimization
- Publisher
- Informa UK Limited
- Published
- 2012-12
- Volume
- 44
- Issue
- 12
- Pages
- 1447-1462
- ISSN
- 0305-215X (ISSN-L)
- 1029-0273
- OpenAlex
- W2069116252
- Cited by
- 366
- References
- 29
- FWCI
- 20.58
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.