Ant Algorithm is a novel simulated evolutionary algorithm which was proposed first by M.Dorigo and had been applied to Traveling Salesman Problems (TSP) with great success. Later, the algorithm has been applied to other combinatorial optimization problems such as Quadratic Assignment Problem (QAP), Vehicle Routing Problem (VRP), Graph Coloring Problem (GCP) and Network Routing Problem (NRP) etc.. It has been proved that Ant Algorithm has the characteristics... Ant Algorithm is a novel simulated evolutionary algorithm which was proposed first by M.Dorigo and had been applied to Traveling Salesman Problems (TSP) with great success. Later, the algorithm has been applied to other combinatorial optimization problems such as Quadratic Assignment Problem (QAP), Vehicle Routing Problem (VRP), Graph Coloring Problem (GCP) and Network Routing Problem (NRP) etc.. It has been proved that Ant Algorithm has the characteristics of strong robustness, good convergence and versatility but at the same time has some shortcomings such as needing longer computing time and easy to enter stagnation. |