Research Article

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

Table 6

Comparative results of Case 3 with a novel path repairing technique.

Case 3: path generation without prescribed timing
ParametersABCJADEPBILTLBOACORGWOSCA

80.000079.916269.057142.005366.545343.532680.0000
8.12639.702710.02198.087610.649819.66305.1563
80.000079.630080.000028.266065.304766.218064.8837
51.843922.105066.397724.109962.913742.382061.7959
−19.327613.4224−6.0994−4.48606.079025.1410−40.4117
−11.0023−10.1904−27.8102−4.7935−6.9436−25.6124−80.0000
−1.298825.0942−13.169411.17652.5885−16.735225.4964
29.10043.179626.49263.58707.98508.3961−80.0000
53.9222176.994212.1922203.07140.000010.8144162.9594
349.63930.03778.8375359.165652.818675.467547.9605
35.688631.388045.379238.094876.781788.636477.3485
77.118773.520779.620076.7126111.7879107.011278.7932
115.8808117.422191.7790115.5382139.0174129.7889102.9839
153.8239160.1615140.7557154.7689168.2661155.2651132.9758
193.8898201.3488196.8064196.1914196.3339189.1377158.4142
234.8222238.3213225.1631236.9290236.0848228.5280178.2059
275.8371275.8487272.5570277.6224269.5633255.6323216.7998
311.5613312.9753298.1521319.1629298.2293276.9471227.5118
348.9137355.2115360.0000359.1397322.3910290.1490239.6187
Min1.13312.255141.94440.0192156.607526.8977306.5633
Mean7.79839.2387116.50842.5706310.526470.7824568.2001
Max30.312325.7054306.429928.5182551.2737234.21631144.216
Std7.10364.949662.32386.400483.521943.5185153.6016
Error0.29250.43151.84800.03243.58461.43985.2041
Success30303030303030

Success = number of successful runs.