This paper addresses the problem of finding a suboptimal clique partition of a graph using an ant colony optimization algorithm. A lower bound for the number of clique partitions is proposed, taking into account the geometric characteristics of the problem. Experimental results demonstrate that the method yields optimal solutions for specific configurations of docking stations (with 10 vertical and 1–3 horizontal rows) and suboptimal solutions for more general cases, all within a relatively short computation time. For a lattice graph, the algorithm produced a solution with 8 cliques in under 7 s. These results suggest that the proposed method provides efficient, near-optimal solutions, making it a promising approach for further research. Future work may explore the impact of hyperparameter settings on solution quality and computational efficiency.