By Topic

Mesh partitioning: a multilevel ant-colony-optimization algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Korosec, P. ; Comput. Syst. Dept., Jokf Stefan Inst., Ljubljana, Slovenia ; Silc, J. ; Robic, B.

Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which address the mesh partitioning problem. In this paper we present an enhancement of the technique that uses a 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 the classical k-METIS and Chaco algorithms. Furthermore, it is even comparable to the combined evolutionary/multilevel scheme used in the JOSTLE evolutionary algorithm. Our MACO algorithm returned also some solutions that are better than currently available solutions in the graph partitioning archive.

Published in:

Parallel and Distributed Processing Symposium, 2003. Proceedings. International

Date of Conference:

22-26 April 2003