An adaptive weighted ant colony algorithm

The ant colony algorithm is a metaheuristic algorithm, it provides a new approach for solving discrete optimization problems-the traveling salesman problem, for instance, is usually tested as the benchmark. Since the ant colony algorithm was introduced, many refinements have been developed to improve the performance by refining the pheromone updating strategies, which have achieved great success on the traveling salesman problem. We introduce a new ant colony algorithm based on Adaptive Weighted Updating Rule. Results demonstrate the effectiveness and flexibility of the new algorithm in this paper.