In recent years, clustering with constraints has become a topic of significant interest for many researchers because it allows to take into account the knowledge from the domain, expressed as a set of constraints, and thus to improve the efficiency of the analysis. For example, these approaches can take place in an interactive process where a user iteratively expresses new constraints to refine previous clustering results. In this paper, we propose three new variants of the leader ant clustering with constraint algorithm (MCLA, MELA and CELA) that implements the following constraints: the must-link, cannot-link constraints and epsiv-constraints. These algorithms have been compared to other constraint based clustering algorithms such as K-means clustering with constraints and the original leader ant clustering algorithm. Our experiments show that, on UCI machine learning and artificial data sets, our approach compares well to the other algorithms.