Abstract
Ant colony algorithm ( ant colony algorithm, ACA ), Also known as ant algorithm, is a diagram used to find the probability of path optimization algorithm. Ant colony algorithm is a novel simulated evolutionary algorithm , A preliminary study shows that the algorithm has many good properties. Currently a number of ant colony algorithm has been optimized combination of problems, such as TSP, QAP, JSP, VRP and other issues demonstrated its outstanding prospect. This paper is trying to optimize the existing combination of ant colony algorithm based on the reality of defects, from the pheromone update useless to achieve repetition rate of the control nodes, thereby enhancing the ant colony algorithm in the iterative process of updating optimum capacity. For the same number of iterations to find the path shorter, less costly rules. And in VC++ program to validate the optimal solution of TSP to solve practical problems.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
