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

Table 4

Comparison of the proposed algorithm with the algorithms in the literature for linear BLPPs.

Problem/literature	The result by the proposed algorithm		The result in the literature
	𝐹(𝑥^∗,𝑦^∗)	𝑓(𝑥^∗,𝑦^∗)	𝐹(𝑥^∗,𝑦^∗)	𝑓(𝑥^∗,𝑦^∗)
A.1/[15]	−37.00	14.00	−36.88	13.95
A.2/[16]	−49.00	17.00	−49	17
A.3/[11]	−85.09	50.18	−85.09	50.17
A.4/[17]	−29.20	3.20	−29.2	3.2
A.5/[18]	−19.00	−9.00	−19	−9
A.6/[15]	−3.25	−6.00	−3.25	−6
A.7/[6]	−18.40	1.80	−18.4	1.8
A.8/[19]	14.99	−16.99	15.40	−16.99
A.9/[15]	−453.61	−68.81	−447.46	−11.62