Dynamic Density Clustering Ant Colony Algorithm With Filtering Recommendation Backtracking Mechanism

Jin Yu,Xiaoming You,Sheng Liu

doi:10.1109/access.2020.3002817

Abstract

Ant colony system has a good performance in solving Traveling Salesman Problem (TSP), but it tends to fall into local optimum and is deficient in convergence speed. To address this problem, a dynamic density clustering ant colony algorithm with a filtering recommendation backtracking mechanism is proposed (DBACS). Firstly, a dynamic density clustering strategy is proposed to accelerate the convergence speed of the algorithm and improve the quality of the solution. Under this strategy, the search radius is expanded dynamically to merge adjacent classes, so as to form the differential pheromone distribution. The splicing paths between each class are adjusted through the ant colony algorithm to achieve better performance. Secondly, a recommendation backtracking mechanism based on collaborative filtering is proposed to increase the diversity of the population, thus helping the algorithm jump out of the local optimum. With the help of the collaborative filtering algorithm, some dense data points are recommended for pheromone dynamic backtracking, which can not only help algorithm jump out of the local optimum, but also help the algorithm accelerate convergence. Simulation results show that the improved algorithm can obtain a better solution and higher stability. Especially in solving large-scale TSP, the accuracy of the solution is significantly improved.

Highlights

Traveling salesman problem (TSP) is a classical combinatorial optimization problem
This paper proposes a dynamic density clustering strategy and a recommendation backtracking mechanism based on collaborative filtering
To solve the above problems, a recommendation backtracking mechanism based on collaborative filtering is proposed in combination with the image processing algorithm (DBSCAN) to increase the diversity of the population

Summary

INTRODUCTION

Traveling salesman problem (TSP) is a classical combinatorial optimization problem. The content of TSP is to find the shortest path through all cities on the premise that each city is passed only once. Through this method, the algorithm can quickly construct the initial differential pheromone distribution of the path in the early stage, which provides preparation for the connection of the following connecting-ants. It can be found that the algorithm is most likely to discover the locations of the poor paths in the current solution searching process It can dynamically backdate pheromones in some dense places, greatly improving the accuracy of backtracking, which increases the possibility of the algorithm to jump out of the local optimum

ALGORITHM STEPS Step l

CONCLUSION