When handling tree networks, researchers have sometimes tried using the pruefernumber representation for encoding networks, but GAs often degraded or broke down when used on this encoding. This paper investigates the locality of the pruefernumber and its effect on the performance of a Genetic...

This paper sheds some light on the debate concerning evolutionary search using Prüfer numbers, and explains some of the controversial results. Previous work has shown that Prüfer numbers have low locality. Furthermore, it has been shown elsewhere that the locality of the Prüfer number depends...

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...

When using gentic and evolutionary algorithms (GEAs) for the optimal communication spanning problem, the design of a suitable tree network encoding is crucial for finding good solutions. The link and node biased (LNB) encoding represents the structure of a tree network using a weighted vector...

This paper adresses the optimization of telecommunication networks for a multi-period horizon. Four heuristics are presented to cope with the problem to minimize the overall costsfor a network over several periods. For the minimization of cost we use a simple genetic algorithm (GE).[...]