IJPAM: Volume 5, No. 2 (2003)

A MULTILEVEL ANT-COLONY OPTIMIZATION
ALGORITHM FOR MESH PARTITIONING

Peter Korošec$^1$, Jurij Šilc$^2$, Borut Robic$^3$
$^{1,2}$Computer Systems Department
Jozef Stefan Institute
Jamova 39, SI-1001 Ljubljana, SLOVENIA
$^1$e-mail: peter.korosec@ijs.si
$^2$e-mail: jurij.silc@ijs.si
$^3$Faculty of Computer and Information Science
University of Ljubljana
Trzaška 25, SI-1001 Ljubljana, SLOVENIA
e-mail: borut.robic@fri.uni-lj.si


Abstract.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.

Received: January 14, 2003

AMS Subject Classification: 68W20

Key Words and Phrases: mesh partitioning, randomized algorithm, multilevel algorithm, ant-colony optimization

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2003
Volume: 5
Issue: 2