Accessibility navigation

A parallel genetic algorithm for the Steiner Problem in Networks

Di Fatta, G., Lo Presto, G. and Lo Re, G. (2003) A parallel genetic algorithm for the Steiner Problem in Networks. In: The 15th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2003), 3-5 Nov 2003, Marina del Rey, CA, USA, pp. 569-573.

[img] Text - Accepted Version
· Please see our End User Agreement before downloading.


It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.


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

Item Type:Conference or Workshop Item (Paper)
Divisions:No Reading authors. Back catalogue items
Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
ID Code:6149
Uncontrolled Keywords:internet topology, parallel genetic algorithm, Steiner problem topology.


Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation