2018
DOI: 10.3390/electronics8010019
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Subpopulation Based Parallel TLBO Optimization Algorithms

Abstract: A numerous group of optimization algorithms based on heuristic techniques have been proposed in recent years. Most of them are based on phenomena in nature and require the correct tuning of some parameters, which are specific to the algorithm. Heuristic algorithms allow problems to be solved more quickly than deterministic methods. The computational time required to obtain the optimum (or near optimum) value of a cost function is a critical aspect of scientific applications in countless fields of knowledge. Th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 17 publications
0
6
0
Order By: Relevance
“…Meanwhile, fuzzy TLBO required the most time to classify all datasets. This could be because the fuzzy TLBO's slow training procedure utilized a large amount of computer memory, making it time demanding [193]- [195]. The comparison of time expresses in Table 2.…”
Section: Resultsmentioning
confidence: 99%
“…Meanwhile, fuzzy TLBO required the most time to classify all datasets. This could be because the fuzzy TLBO's slow training procedure utilized a large amount of computer memory, making it time demanding [193]- [195]. The comparison of time expresses in Table 2.…”
Section: Resultsmentioning
confidence: 99%
“…In addition, it depends on the objective function. Regarding a global convergence analysis, both TLBO and CJaya behave better but with a higher order of complexity (see [77,80]). Moreover, it is noted that when using TLBO, two new individuals are generated in each iteration; one in the teacher phase and the other one in the learner phase.…”
Section: Population Size 70 140 210mentioning
confidence: 99%
“…García-Monzó et al developed a shared memory-based and message-passing based parallel TLBO algorithm. Authors have used thirty unconstrained benchmark functions to evaluate the performance of proposed approach [49]. Other parallel implementation of TLBO found in [2,50] to solve unconstrained benchmark functions.…”
Section: Related Workmentioning
confidence: 99%