Skip to main content
Article thumbnail
Location of Repository

A parallel genetic algorithm for the Steiner Problem in Networks

By Giuseppe Di Fatta, Giuseppe Lo Presto and Giuseppe Lo Re

Abstract

This paper presents a parallel genetic algorithm to the\ud Steiner Problem in Networks. Several previous papers\ud have proposed the adoption of GAs and others\ud metaheuristics to solve the SPN demonstrating the\ud validity of their approaches. This work differs from them\ud for two main reasons: the dimension and the\ud characteristics of the networks adopted in the experiments\ud and the aim from which it has been originated. The reason\ud that aimed this work was namely to build a comparison\ud term for validating deterministic and computationally\ud inexpensive algorithms which can be used in practical\ud engineering applications, such as the multicast\ud transmission in the Internet. On the other hand, the large\ud dimensions of our sample networks require the adoption\ud of a parallel implementation of the Steiner GA, which is\ud able to deal with such large problem instances

Year: 2003
OAI identifier: oai:centaur.reading.ac.uk:6149

Suggested articles


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