Parallel Framework for Ant-Like Algorithms

  • Authors:

  • Mitica Craus;Laurentiu Rudeanu

  • Affiliations:

  • Technical University "Gh.Asachi";Technical University "Gh.Asachi"

  • Venue:
  • ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes the work of an objectual framework designed to be used in the parallelization of a set of related algorithms. As a concrete application a parallel Ant Colony Optimization algorithm (ACO) for the Travelling Salesman Problem (TSP) is presented. The idea behind the system we are describing is to have a re-usable framework for running several sequential algorithms in a parallel environment. The algorithms that the framework can be used with have several things in common: they have to run in cycles and the work should be possible to be split between several "processing units". The parallel framework uses the message-passing communication paradigm and is organized as a master-slave system. The ACO for TSP implemented by means of the parallel framework proves to have good performances: approximatively linear speedup and low communication cost.