Table 2: The detailed information of the optimal solutions obtained so far on the twelve test problems.
 No. Optimal solution Optimal Value Value of constraint Kp1 (0, 1, 1, 1, 0, 0, 0, 1, 1, 1) 295 0 Kp2 (1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1) 1024 −7 Kp3 (1, 1, 0, 1) 35 −2 Kp4 (0, 1, 0, 1) 23 0 Kp5 (0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1) 481.0694 −20.0392 Kp6 (0, 0, 1, 0, 1, 1, 1, 1, 0, 0) 50 0 Kp7 (1, 0, 0, 1, 0, 0, 0) 107 0 Kp8 (1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0) 9767 −232 Kp9 (1, 1, 1, 1, 0) 130 −20 Kp10 (1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1) 1025 −8 Kp11 (1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0) 3119 0 Kp12 (1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1) 26559 −1