By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lifang Chen ; Coll. of Sci., Hebei Polytech. Univ., Tangshan, China ; Lijing Feng ; Xinchun Wang

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.

Published in:

Computer and Automation Engineering (ICCAE), 2010 The 2nd International Conference on  (Volume:3 )

Date of Conference:

26-28 Feb. 2010