Optimal Synthesis of Four-Bar Linkage Path Generation through Evolutionary Computation with a Novel Constraint Handling Technique

Algorithm 2

Repairing Grashof criterion constraint.

	Input: infeasible {} and bounds:
	Output: feasible {}
(1)	Generate uniform random numbers {} whose values are in the range of [0.0001, 1]
(2)	If , swop their positions
(3)	Else if , set
(4)	Assign values
(5)	If , compute
(6)	Compute for
(7)	Assign and assign as the lengths of , respectively