Designing Reliable Communication Networks with a Genetic Algorithm using a Repair Heuristic

Reichelt, Dirk ; Rothlauf, Franz ; Gmilkowsky, Peter

heinzl14.pdf - Published

Download (129kB)

URN: urn:nbn:de:bsz:180-madoc-893
Document Type: Working paper
Year of publication: 2003
The title of a journal, publication series: Working Papers in Business Administration and Information Systems
Volume: 14/03
Place of publication: Mannheim
Publication language: German
Institution: Business School > Sonstige - Fakultät für Betriebswirtschaftslehre
MADOC publication series: Area Information Systems and Institute for Enterprise Systems > Working Papers Lehrstuhl für ABWL und Wirtschaftsinformatik (Heinzl) (bis 2011)
Subject: 004 Computer science, internet
Subject headings (SWD): Netzwerk , Algorithmus
Individual keywords (German): Netzwerk , Algorithmus
Abstract: This paper investigates GA approaches for solving the reliable communication network design problem. For solving this problem a graph with minimum cost must be found that satisfies a given network reliability constraint. To consider the additional reliability constraint different approaches are possible. We show that existing approaches using penalty functions can result in invalid solutions and are therefore not appropriate for solving this problem. To overcome these problems we present a repair heuristic, which is based on the number of spanning trees in a graph. This heuristic always generates a valid solution, which when compared to a greedy cheapest repair heuristic shows that the new approach finds better solutions with less computational effort.

Dieser Eintrag ist Teil der Universitätsbibliographie.

Das Dokument wird vom Publikationsserver der Universitätsbibliothek Mannheim bereitgestellt.

Metadata export


+ Search Authors in

+ Download Statistics

Downloads per month over past year

View more statistics

You have found an error? Please let us know about your desired correction here: E-Mail

Actions (login required)

Show item Show item