2017
DOI: 10.1016/j.knosys.2017.08.012
|View full text |Cite
|
Sign up to set email alerts
|

Four-bar linkage path generation through self-adaptive population size teaching-learning based optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
37
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 50 publications
(37 citation statements)
references
References 25 publications
0
37
0
Order By: Relevance
“…This technique has been used by Sleesongsom and Bureerat [30] for studying the performance of meta-heuristics (MHs) in solving the four-bar linkage path generation problems. The Friedman test is suitable for comparing more classifiers over multiple data sets.…”
Section: The Performance Index and Non-parametric Statistical Testmentioning
confidence: 99%
“…This technique has been used by Sleesongsom and Bureerat [30] for studying the performance of meta-heuristics (MHs) in solving the four-bar linkage path generation problems. The Friedman test is suitable for comparing more classifiers over multiple data sets.…”
Section: The Performance Index and Non-parametric Statistical Testmentioning
confidence: 99%
“…One task for designing a four-bar linkage is a path generation problem. This synthesis problem is aimed at finding significant link lengths of the mechanism to achieve a point on a coupler link moving along the desired path [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. The problem is usually converted to be an optimization problem, which is posed to find the dimensions of a mechanism and some other parameters.…”
Section: Introductionmentioning
confidence: 99%
“…The path generation problem is of interest by many researchers due to the advantage of using such a mechanism such as work reported by Sleesongsom and Bureerat [16]. Almost all of the previous work tried to improve the design performance of the path synthesis problem in both the constraint handling [10][11]16] and the performance of an optimizer [1][2][3][4][5][6][7][8][9]16]. The path synthesis optimization problem normally composes of two types of constraints.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations