Using the Genetic Algorithms for Solving Minimal Steiner Tree Problem

Ivana Ljubiĉ
Jozef Kratica
Vladimir Filipoviĉ

Abstract

This paper shows a comparison between two hybrid GA (based on existing heuristics) resolving a minimal Steiner tree problem. The exact algorithms resolve this problem in exponential time. Two diferent formulations, and two diferent approaches are compared.

Keywords: NP competeness, Minimum Steiner tree problem, Genetic Algorithms.

Back to Jozef's Papers Home Page | Back to Jozef's Home Page