Skip to main content
Article thumbnail
Location of Repository

Mesh Partitioning: A Multilevel Ant-Colony-Optimization Algorithm

By Borut Robič

Abstract

Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses the mesh partitioning problem. In this paper we present an enhancement of the technique that uses nature inspired metaheuristic to achieve higher quality partitions. We apply and study a multilevel ant-colony (MACO) optimization, which is a relatively new metaheuristic search technique for solving optimization problems. The MACO algorithm performed very well and is superior to classical k-METIS and Chaco algorithms. Furthermore, it is even comparable to combined evolutionary/multilevel scheme used in JOSTLE evolutionary algorithm. Our MACO algorithm returned also some solutions that are better then currently available solutions in the Graph Partitioning Archive. 1

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.6072
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://csd.ijs.si/silc/article... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.