The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2010
DOI: 10.1016/j.mechmachtheory.2010.03.011
|View full text |Cite
|
Sign up to set email alerts
|

A GA–DE hybrid evolutionary algorithm for path synthesis of four-bar linkage

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
118
0
1

Year Published

2012
2012
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 151 publications
(119 citation statements)
references
References 16 publications
0
118
0
1
Order By: Relevance
“…In order to obtain the appropriate values of the angles θ 3 and θ 4 , the sign of the radicals in (13) and (14) are (+ √ ) and (− √ ), respectively; this is due to the open configuration in the FBM considered.…”
Section: Kinematic Analysis Of the Fbmmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to obtain the appropriate values of the angles θ 3 and θ 4 , the sign of the radicals in (13) and (14) are (+ √ ) and (− √ ), respectively; this is due to the open configuration in the FBM considered.…”
Section: Kinematic Analysis Of the Fbmmentioning
confidence: 99%
“…In that work, the DE shows faster convergence to the optimal result and a smaller error of adjustment to target points, than the genetic algorithm (GA) and the particle swarm optimization (PSO). The work presented in [13] proposed an evolutionary algorithm to solve the path synthesis problem of a four-bar linkage. In [10], another design approach of a four-bar mechanism for path generation purposes is formulated as a constrained multi-objective optimization problem.…”
Section: Introductionmentioning
confidence: 99%
“…An exact solution for this problem is not possible because of the limited number of dimensions available, but various techniques have been used for approximate solutions. The most common techniques used include conventional optimization methods (Tomas, 1968;Sancibrian et al, 2004;Diab and Smaili, 2008), using atlases of mechanisms (Zhang et al, 1984), simulated annealing (Ullah and Kota, 1996), and genetic algorithms or evolutionary algorithms (Cabrera et al, 2002;Laribi et al, 2004;Starosta, 2008;Lin, 2010).…”
Section: Introductionmentioning
confidence: 99%
“…Several optimization algorithms, including exact gradient [9], simulated annealing [13], genetic algorithm (GA) and modified GA [7,8,10,11,19,23,25], ant-gradient [6,17,26], genetic algorithmfuzzy logic [24], differential evolution (DE) and modified DE [14-16, 18, 19, 21, 22, 27], particle swarm optimization [19], GA-DE [20,28], and hybrid optimizer [29], are used to solve the optimization problems of path synthesis. In the one-phase synthesis method, the error function in [9][10][11][14][15][16][17][18][19][20][21][22] is based on the sum of the square of Euclidean distance error (termed the square deviation in this study) between the target points and the corresponding coupler points. The error function in [23,24] is based on the orientation structural error of the fixed link.…”
Section: Introductionmentioning
confidence: 99%
“…of the fitness of the function without influence of translation, rotation, and scaling effect. In this work, the challenging path synthesis problems for the special trajectories generating by the geared five-bar mechanism is studied using the one-phase synthesis method, where the error function of the square deviation of positions is used as the objective function and the GA-DE evolutionary algorithm [20,28] is used to solve the optimization problem. Figure 1 depicts a stick diagram and all the geometric parameters of a geared five-bar mechanism with circular gears.…”
Section: Introductionmentioning
confidence: 99%