[Retracted] A Hybrid Algorithm of Ant Colony and Benders Decomposition for Large-Scale Mixed Integer Linear Programming

Table 2

Numerical results of benchmark example.

Approach	Upper bound	Lower bound	CPU (s)	Iteration	Gap (%)
CPLEX	544	544	1.58	12	0
GUROBI	544	544	1.21	11	0
Benders	544	544	32.3	9	0
ADMM	590	531	0.39	8	8.2
ACA	602	527	0.40	7	10.6
Hybrid algorithm	586	537	0.35	6	4