An Ant Colony Algorithm With New Genetic Features Applied To Quadratic Assignment Problems

In this paper,we present a novel improvement and results for a computational paradigm called Ant Colony Optimization (ACO)。We begin with the introduction of some related topics, including the Combinatorial Optimization and the conception of NP-hard,using the Quadratic Assignment Problem as an example。Then we introduce the background and the details of Ant Colony Optimization。In the applications of ACO,we emphasize on some existing methods solving QAP problem by ACO。The new improvements and results of ACO solving QAP problem are presented at last,which are the main work of this paper。Ant colony algorithm is novel simujlated evolutionary algorithm,which has good result on solving combinatorial problems。The research shows that this algorithm can be commonly used and is very good robustness.Its basic shortcomings, which are long searching time and easily jumping into local optimal solution, have been overcome partially and some effective methods are introduced too。However,the problems are not completely solved。We use the new algorithm to decrease computinig time,at the same time,it can avoid early maturing phenomenon。We put some improvements on ACO through analyzed the...