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

Of late, much progress has been made in developing Estimation of DistributionAlgorithms (EDA), algorithms that use probabilistic modelling of high quality solutionsto guide their search. While experimental results on EDA behaviour are widelyavailable, theoretical results are still rare. This is...

Metaheuristics, such as evolutionary algorithms or simulated annealing,are widely applicable heuristic optimization strategies that have shownencouraging results for a large number of diffcult optimization problems.To show high performance, metaheuristics need to be adapted to theproperties of...

The edge-set encoding is a direct tree representation which directly representstrees as sets of edges. There are two variants of the edge-set encoding:the edge-set encoding without heuristics, and the edge-set encoding withheuristics. An investigation into the bias of the edge-set encoding...

Estimation of distribution algorithms (EDAs) are population-basedheuristic search methods that use probabilistic models and which havebeen successfully applied to continuous optimization problems. When appliedto constrained optimization problems, most EDAs (as well as geneticalgorithms) handle...

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

This paper investigates how the use of the trivial voting (TV) mapping influences the performanceof genetic algorithms (GAs). The TV mapping is a redundant representation for binaryphenotypes. A population sizing model is presented that quantitatively predicts the influence ofthe TV mapping and...

This paper investigates how the performance of evolutionary search is inuenced by thelocality and distance distortion of the used representation. The locality of a representationdescribes how well neighboring phenotypes correspond to neighboring genotypes. The distancedistortion measures whether...

This paper presents and compares three heuristics for the combinatorial auctionproblem. Besides a simple greedy (SG) mechanism, two metaheuristics, a simulatedannealing (SA), and a genetic algorithm (GA) approach are developedwhich use the combinatorial auction process to an allocation with...

This paper considers the optimal communication spanning tree (OCST) problem. Previouswork analyzed features of high-quality solutions and found that edges in optimal solutions havelow weight and point towards the center of a tree. Consequently, integrating this problem-specific knowledge into a...