Assignment Problem Based on Improved Ant Colony Algorithm

Abstract:

Article Preview

Assignment problem is a combinatorial optimization problem.In this paper,a improved ant colony algorithm is proposed to solve the assignment problem.According to the rule of state-shift and strategty of updating pheromone, parameters of the ant colony Algorithm are optimized and changed,the best solution can be found rapidly,the simulative results show that the improvement strategies can well improve convergence speed and quality.

Info:

Periodical:

Edited by:

Qi Luo

Pages:

356-360

DOI:

10.4028/www.scientific.net/AMM.55-57.356

Citation:

Z.’e Gao and G. J. Zhang, "Assignment Problem Based on Improved Ant Colony Algorithm", Applied Mechanics and Materials, Vols. 55-57, pp. 356-360, 2011

Online since:

May 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.