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

Genetic algorithms are sometimes disparagingly denoted as just a fancier form of a plain, stupidheuristic. One of the main reasons for this kind of critique is that users believed a GA could notguarantee global convergence in a certain amount of time.Because the proof of global convergence of...

Evolution strategies (ES) are efficient optimization methods for continuous problems. However, many combinatorial optimization methods can not be represented by using continuous representations. The development of the network random key representation (Rothlauf et al., 2001) which represents...

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

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

When handling tree networks, a number of researchers have tried using the pruefernumberrepresentation for encoding the network, but GAs often degraded or broke down when used onthis encoding. This paper investigates the locality of the pruefernumber, which can be describedas the relatedness of...

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 car sequencing problem determines sequences of different car models launched down a mixed-model assembly line. To avoid work overloads of workforce, car sequencing restricts the maximum occurrence of labor-intensive options, e.g., a sunroof, by applying sequencing rules. We consider this...