New robust and efficient ant colony algorithms: Using new interpretation of local updating process

摘要

Two new efficient and robust ant colony algorithms are proposed. These algorithms contain two new and reasonable local updating rules that make them more efficient and robust. While going forward from start point to end point of a tour, the ants’ freedom to make local changes on links is gradually restricted. This idea is implemented in two different forms, leaving two new algorithms, KCC-Ants and ELU-Ants. To evaluate the new algorithms, we run them along with the old one on the standard TSP library, where in almost all of the cases the proposed algorithms had better solutions and even for some problem samples found the optimal solution.