Ant colony global optimization for a class of two-layer linear programming problems

This paper presents an algorithm based on the ant colony for solving a class of two-layer linear programming global optimization problems. We can use Ant colony algorithm for solving the upper problem and simplex algorithm for the lower the linear programming problem. The combination of algorithms designed is very clear. The numerical results show that the algorithm has good global convergence reliability and high convergence speed, so it is efficient for solving a two-layer linear programming problems.