A Kind of Negative Feedback ACO Algorithm Based on Minimum Distance Balance Factor

The traditional ACO (ant colony optimization) needs quite a long time to converge and is prone to loop into a standstill in the optimization process of TSP (traveling salesman problem). In this paper, one kind of negative feedback ACO on minimum distance balance factor is proposed. Simulation results show its very effectiveness. Compared with the traditional ACO, the negative feedback ACO can greatly improve the probability of gaining the best solution from 25.6% to 41.6%.