The edge-set encoding is a direct tree encoding which applies search oper-ators directly to trees represented as sets of edges. There are two variantsof crossover operators for the edge-set encoding: With heuristics that con-sider the weights of the edges, or without heuristics. Due to a strong...

For the reliable communication network design (RCND) problem links areunreliable and for each link several options are available with dierent reliabilitiesand costs. The goal is to nd a cost-minimal communicationnetwork design that satises a pre-dened overall reliability constraint.This paper...

Until recently, multidimensional knapsack problems (MDKP)and winner determination problems (WDP) have been studiedindependently of each other, although WDPs can bemodelled as MDKPs. State-of-the-art optimization methodsfor WDPs are exact algorithms whereas MDKPs aremainly solved using heuristics...

The edge-set encoding is a direct encoding for trees which directly representstrees as sets of edges. In contrast to indirect representations, whereusually standard operators are applied to a list of strings and the resultingphenotype is constructed by an appropriate genotype-phenotypemapping,...

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).[...]

The most important element in the design of a decoder-based evolutionary algorithmis its genotypic representation. The genotype-decoder pair must exhibit efficiency, locality, and heritability to enable effective evolutionary search.[...]

This paper investigates how the use of redundant representations influences the performance ofgenetic and evolutionary algorithms. Representations are redundant if the number of genotypesexceeds the number of phenotypes. A distinction is made between synonymously and nonsynonymouslyredundant...

The optimal communication spanning tree (OCST) problemis a well known NP-hard combinatorial optimizationproblem which seeks a spanning tree that satisfies all givencommunication requirements for minimal total costs. Ithas been shown that optimal solutions of OCST problemsare biased towards the...

This paper presents an investigation into the properties of the optimal communication spanningtree (OCST) problem. The OCST problem nds a spanning tree that connects all nodesand satises their communication requirements for a minimum total cost. The paper comparesthe properties of randomly...