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

Author

Chen, Lifang ; Feng, Lijing ; Wang, Xinchun

Author_Institution

Coll. of Sci., Hebei Polytech. Univ., Tangshan, China

Volume

3

fYear

2010

fDate

26-28 Feb. 2010

Firstpage

583

Lastpage

585

Abstract

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.

Keywords

convergence; linear programming; ant colony algorithm; ant colony global optimization; global convergence reliability; high convergence speed; two-layer linear programming; Algorithm design and analysis; Ant colony optimization; Chaos; Convergence of numerical methods; Decision making; Design optimization; Educational institutions; Genetic algorithms; Linear programming; Simulated annealing; ant colony algorithm; global optimization; two-layer linear programming;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Singapore

Print_ISBN

978-1-4244-5585-0

Electronic_ISBN

978-1-4244-5586-7

Type

conf

DOI

10.1109/ICCAE.2010.5451813

Filename

5451813