Approximate Solution of The Linear Programming Problems By Ant System Optimization
Engineering and Technology Journal,
2009, Volume 27, Issue 16, Pages 2978-2995
AbstractIn this paper we use the ant system optimization metaheuristic to find
approximate solution to the linear programming problems, we also use the duality theory to estimate how good is this approximate solution and check if it is optimal, the advantageous and disadvantageous of the suggested method also discussed focusing on the parallel computation and real time optimization, it's worth to mention here that the suggested method doesn't require any artificial variables the slack and surplus variables are enough, a test example is given at the end to show
how the method works.
- Article View: 161
- PDF Download: 27