Power-law Transformation Optimized Ant Colony System for the Travel Quotient Problem
To solve the traveling salesman problem,a power law transformation based optimization ant colony algorithm is proposed based on the optimization of ant colony system in ant colony algorithm.Firstly,using power-law transformation to optimize ant colony algorithm to im-prove the local updating formula of pheromones;Then,in the state transition,a power-law transformation is used to determine the number of times the population has traversed each path,and the impact of local pheromone updates is analyzed through normalization to accelerate the convergence speed of the model;Finally,random addition of Levy flight to disrupt global pheromones prevents the model from falling into lo-cal optima too early.Through a large number of instances provided by the TSPLAB database,it has been verified that the power law transforma-tion optimized ant colony algorithm can effectively avoid the model from falling into local optima too early while maintaining a fast convergence speed.
万方数据
维普
