Designing Reliable Communication Networks with a GeneticAlgorithm using a Repair Heuristic

This paper investigates GA approaches for solving the reliable communicationnetwork design problem. For solving this problem a graph withminimum cost must be found that satises a given network reliabilityconstraint. To consider the additional reliability constraint dierent approachesare possible. We show that existing approaches using penaltyfunctions can result in invalid solutions and are therefore not appropriatefor solving this problem.[...]

MoreLess

Year of publication:	2003-12-05
Authors:	Reichelt, Dirk ; Rothlauf, Franz ; Gmilkowsky, Peter
Institutions:	Betriebswirtschaftliches Institut <Mannheim> ; Universität <Mainz> / Lehrstuhl für Wirtschaftsinformatik und BWL
Subject:	Genetischer Algorithmus \| genetic algorithm \| Netzwerk \| Heuristik \| Heuristic Optimization

Check Google Scholar |

More access options

In German libraries (KVK)

I need help

1 Introduction
2 Problem Denition
3 Considering Reliability Constraints in Genetic Algorithms
3.1 Penalty Functions
3.2 Problem-Specic Representations and Operators
4 Repair Heuristics
4.1 Decits of Existing Approaches
4.2 Spanning tree counting repair heuristic
5 Experiments
5.1 Experimental Design
5.2 Results
6 Conclusions
References

Persistent link: https://www.econbiz.de/10005868179