Research Article

A Differential Evolution with Two Mutation Strategies and a Selection Based on an Improved Constraint-Handling Technique for Bilevel Programming Problems

Table 6

Best results obtained by the proposed algorithm for first set of nonlinear BLPPs.

Problem

B.1(0.00, 30.00, −10.00, 10.00)0.00100.00
B.2(0.00, 2.00, 1.88, 0.91)−12.68−1.01
B.3(7.02, 3.03, 11.98, 17.97, 0.05, 10.00, 29.95, 0)6600.0024.58, 29.54
B.4(1.95, 8.05, 0.00, 0.97, 0.97, 1.31, 6.74, 0, 0)9.561.61, 7.09, 0
B.5(7.07, 7.07, 7.07, 7.07)1.98−1.98
B.6(0.00, 0.90, 0.00, 0.60, 0.40)−29.200.31
B.7(0.00, 30.00, −10.00, 10.00)0.00100.00
B.8(20.00, 5.00, 10.00, 5.00)0.00100.00
B.9(1.89, 0.89, 0.00)0.007.61
B.10(0.00, 0.90, 0.00, 0.60, 0.40)0.000.31