The Generalized Traveling Salesman Problem is one of a well known complex combinatorial optimization problems. Equality-Generalized Traveling Salesman Problem is a particular case of it. Themain objective of the problem it is to find a minimum cost tour passing through exactly one node from each cluster of a large-scale undirected graph. Multi-agent approaches are successfully used nowadays for solving real life complex problems. The aim of the current paper is to illustrate some agent-based algorithms, including particular ant-based models and virtual robots-agents with specific properties for solving Equality-Generalized Traveling Salesman Problem.