LAUSR

Constraint satisfaction problem (CSP) is a fundamental problem in the field of constraint programming. To tackle this problem more efficiently, an improved ant colony optimization algorithm is proposed. In order to further improve the convergence speed under the premise of not influencing the quality of the solution, a novel strengthened pheromone updating mechanism is designed, which strengthens pheromone on the edge which had never appeared before, using the dynamic information in the process of the optimal path optimization. The improved algorithm is analyzed and tested on a set of CSP benchmark test cases. The experimental results show that the ant colony optimization algorithm with strengthened pheromone updating mechanism performs better than the compared algorithms both on the quality of solution obtained and on the convergence speed.