Many optmization algorithms are developed over period of time, among these most famous and widely used is Ant Colony systems (ACA). Ant Colony Systems (ACS) are the collection of different ant colony optimization algorithms. Different algorithms are used for solve the Travelling salesmen Problem (TCP) but ant colony algorithm is more preferred to solve the travelling salesmen problem. In ant colony best solution is found with the help of cooperating agents called ants. Ants cooperate with each other and communicate using an indirect way with the help of pheromone which is deposited on the edges on the path. To achieve the finest solution, different ant colony techniques are compared. In this study we compared different Ant Colony Systems (ACS) algorithms through their implementation on classical problem of Travelling salesmen Problem (TCP).