Ant Colony Algorithm Based on Little Window

This paper proposes an ant colony algorithm based on little window from typical ant algorithm. By analyzing the solution space of TSP to find characteristics about optimization solution, this algorithm reduces the scope of solution space and the dependence on critical parameter in typical algorithm. It improves the precision and reduces the searching time. Simulations demonstrates that the improved algorithm can achieve better performance than typical algorithm and some other improved algorithms.