Research Article

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

Table 1

Comparative results for Case 1 with a novel path repairing technique.

Case 1: path generation without prescribed timing
ParametersABCJADEPBILTLBOACORGWOSCA

39.786152.476253.799557.904259.476033.430528.3704
10.150514.31109.43038.53599.10509.87395.8563
50.444748.098944.107020.584651.886038.504860.0000
35.256847.536346.559955.522320.478453.319338.7556
45.151130.215547.87225.0306−6.947437.563260.0000
7.2885−14.870732.820135.6648−21.9732−10.3487−60.0000
50.778211.709460.000047.0842−8.8106−5.2992−60.0000
−0.9366−3.1269−8.892012.555428.894459.684760.0000
82.270951.138745.4292355.377296.7425234.83530.0000
288.6774313.0937352.69499.4470276.1848334.32670.0000
18.7094338.580724.315623.8648298.90375.978671.2728
39.4220359.858229.961237.4934337.621731.439886.9490
57.006918.511356.129951.6572358.493561.3596103.9052
75.013444.851773.485967.999133.920090.2248130.0967
103.282085.9854136.620491.035457.5750139.0187166.4231
Min0.63741.82556.75390.001049.19610.327142.5282
Mean4.12977.593320.06810.370573.15828.5501144.5432
Max11.901517.002247.57972.7424101.703994.4204391.5969
Std2.76843.409210.16400.666716.113217.001294.5604
Error0.23800.45020.82320.01222.68070.21072.6387
Success30303030303030

Success = number of successful runs.