In this paper we present a multilevel ant-colony optimization algorithm, which is a relatively new metaheuristic technique for solving combinatorial optimization problems. We apply this algorithm to the mesh partitioning problem, which is an important problem with extensive applications in various real world engineering problems. The algorithm outperforms the classical k-METIS and Chaco algorithms. In addition, it is comparable even to the combined evolutionary/multilevel scheme used in JOSTLE algorithm.