Research Article

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

Table 7

Comparative results of Case 3 with a penalty technique.

Case 3: path generation without prescribed timing
ParametersABCJADEPBILTLBOACORGWOSCA

68.173219.990140.602917.75540.000059.78630.0000
9.46185.83578.16085.02310.00005.00000.0000
80.000043.167750.066432.91050.000074.94750.0000
80.000050.338534.876031.25670.000030.60400.0000
−1.181318.7411−0.37385.86410.000015.47300.0000
−13.1623−25.013026.805824.60390.000080.00000.0000
−1.162741.070826.791810.39440.000030.74880.0000
16.368712.836230.3681−16.09680.0000−70.67400.0000
360.0000134.823599.1181309.43840.00004.49560.0000
0.0000172.617932.5643351.27550.0000360.00000.0000
37.4238325.249972.495252.70760.000034.65170.0000
75.2680337.086888.586894.62520.0000102.84430.0000
114.895220.4030112.0993143.07340.0000135.98330.0000
152.8726182.4764173.3556190.60710.0000164.55010.0000
191.5270331.0880201.7909317.90200.0000186.75820.0000
232.142182.2786258.3224129.44800.0000188.67090.0000
274.8734134.4962280.6872300.96990.00008.03080.0000
314.3132241.5786318.6172335.03570.000019.98260.0000
0.0000303.143543.3601357.23760.000051.89220.0000
Min1.07141212.69742.6040352.34510.0000251.27200.0000
Mean38.23671212.697402.5957576.64540.0000493.24130.0000
Max110.67961212.697781.4347990.37430.00001901.8360.0000
Std25.29060.0000398.2755210.17560.0000402.52660.0000
Error0.307410.10611.99094.97880.00004.69020.0000
Success2914100150

Success = number of successful runs.