Solving a combinatorial problem using a local optimization in ant based system

Local optimizations introduced to obtain improved tours for Traveling Salesman Problem have a great impact on the final solution. That is way we introduce a new ant system algorithm with a new local updating pheromone rule, and the tours are improved using k-opt techniques. The tests use different parameters, in order to obtain solutions close to the optimal values.


Manuscript, Department of Computer-Science, Babes-Bolyai University, Cluj-Napoca, Romania, December 2005