2016
DOI: 10.1016/j.ins.2016.02.054
|View full text |Cite
|
Sign up to set email alerts
|

Constrained optimization based on improved teaching–learning-based optimization algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 56 publications
(18 citation statements)
references
References 61 publications
0
18
0
Order By: Relevance
“…ICTLBO [142] (Improved constrained teaching-learningbased optimization) is proposed for the constrained optimization problem. In teacher phase, according to the Euclidean distance, the population P is partitioned into k subpopulation, each size of subpopulation is NS.…”
Section: (T Fmentioning
confidence: 99%
“…ICTLBO [142] (Improved constrained teaching-learningbased optimization) is proposed for the constrained optimization problem. In teacher phase, according to the Euclidean distance, the population P is partitioned into k subpopulation, each size of subpopulation is NS.…”
Section: (T Fmentioning
confidence: 99%
“…(3) Initialize learners and evaluate them; (4) while stopping condition is not met (5) Choose the best learner as x teacher ; (6) Calculate the mean x mean of all learners; (7) for each learner x (8) // Teacher phase // (9) T F = round(1 + rand(0, 1)); (10) Update the learner according to Eq. (1); (11) Evaluate the new learner x ,new ; (12) Accept x ,new if it is better than the old one x ,old (13) // Learner phase // (14) Randomly select another learner x which is different from x ; (15) Update the learner according to Eq. (2); (16) Evaluate the new learner x ,new ; (17) Accept x ,new if it is better than the old one x ,old ; (18) end for (19) The second category is the hybrid TLBO method by combining it with other search strategies.…”
Section: Improvements On Tlbomentioning
confidence: 99%
“…TLBO utilizes two productive operators, namely, teacher phase and learning phase to search good solutions [12]. Due to its attractive characters such as simple concept, without the specific algorithm parameters, easy implementation, and rapid convergence, TLBO has captured great attention and has been extended to handle constrained [13], multiobjective [14], large-scale [15], and dynamic optimization problems [16]. Furthermore, TLBO has also been successfully applied to many scientific and engineering fields, such as neural network training [17], power system dispatch [18], and production scheduling [19].…”
Section: Introductionmentioning
confidence: 99%
“…At the same time, because of the large number of existing TLBO algorithms and their variants in the public domain, TLBO is a feasible and promising approach for complex optimization problems. Hence, TLBO has been extended to many complex optimization problems such as large scale non-linear optimization problems [52], multi-objective problems [17], economic dispatch [4], and clustering problems [39].…”
Section: Motivationsmentioning
confidence: 99%