arXiv subjects

Markus Wagner

Publications and source records attributed to Markus Wagner.

101 records · Page 6Linked to original sources

arXiv2014

Seeding the Initial Population of Multi-Objective Evolutionary Algorithms: A Computational Study

Most experimental studies initialize the population of evolutionary algorithms with random genotypes. In practice, however, optimizers are typically seeded with good candidate solutions either previously known or created according to some problem-specific method. This "seeding" has been studied extensively for single-objective problems. For multi-objective problems, however, very little literature is available on the approaches to seeding and their individual benefits and disadvantages. In this article, we are trying to narrow this gap via a comprehensive computational study on common real-valued test functions. We investigate the effect of two seeding techniques for five algorithms on 48 optimization problems with 2, 3, 4, 6, and 8 objectives. We observe that some functions (e.g., DTLZ4 and the LZ family) benefit significantly from seeding, while others (e.g., WFG) profit less. The advantage of seeding also depends on the examined algorithm.

cs.NE↗

arXiv2012

A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem

Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesman problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt.

cs.DS↗

arXiv2012

A Fast and Effective Local Search Algorithm for Optimizing the Placement of Wind Turbines

The placement of wind turbines on a given area of land such that the wind farm produces a maximum amount of energy is a challenging optimization problem. In this article, we tackle this problem, taking into account wake effects that are produced by the different turbines on the wind farm. We significantly improve upon existing results for the minimization of wake effects by developing a new problem-specific local search algorithm. One key step in the speed-up of our algorithm is the reduction in computation time needed to assess a given wind farm layout compared to previous approaches. Our new method allows the optimization of large real-world scenarios within a single night on a standard computer, whereas weeks on specialized computing servers were required for previous approaches.

cs.NE↗

arXiv2011

Predicting the Energy Output of Wind Farms Based on Weather Data: Important Variables and their Correlation

Wind energy plays an increasing role in the supply of energy world-wide. The energy output of a wind farm is highly dependent on the weather condition present at the wind farm. If the output can be predicted more accurately, energy suppliers can coordinate the collaborative production of different energy sources more efficiently to avoid costly overproductions. With this paper, we take a computer science perspective on energy prediction based on weather data and analyze the important parameters as well as their correlation on the energy output. To deal with the interaction of the different parameters we use symbolic regression based on the genetic programming tool DataModeler. Our studies are carried out on publicly available weather and energy data for a wind farm in Australia. We reveal the correlation of the different variables for the energy output. The model obtained for energy prediction gives a very reliable prediction of the energy output for newly given weather data.

cs.AI↗

arXiv2011

Evolving Pacing Strategies for Team Pursuit Track Cycling

Team pursuit track cycling is a bicycle racing sport held on velodromes and is part of the Summer Olympics. It involves the use of strategies to minimize the overall time that a team of cyclists needs to complete a race. We present an optimisation framework for team pursuit track cycling and show how to evolve strategies using metaheuristics for this interesting real-world problem. Our experimental results show that these heuristics lead to significantly better strategies than state-of-art strategies that are currently used by teams of cyclists.

cs.NE↗

arXiv2011

Computational Complexity Results for Genetic Programming and the Sorting Problem

Genetic Programming (GP) has found various applications. Understanding this type of algorithm from a theoretical point of view is a challenging task. The first results on the computational complexity of GP have been obtained for problems with isolated program semantics. With this paper, we push forward the computational complexity analysis of GP on a problem with dependent program semantics. We study the well-known sorting problem in this context and analyze rigorously how GP can deal with different measures of sortedness.

cs.NE↗

arXiv2010

Faster Black-Box Algorithms Through Higher Arity Operators

We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black-box model by considering higher arity variation operators. In particular, we show that already for binary operators the black-box complexity of \leadingones drops from $Θ(n^2)$ for unary operators to $O(n \log n)$. For \onemax, the $Ω(n \log n)$ unary black-box complexity drops to O(n) in the binary case. For $k$-ary operators, $k \leq n$, the \onemax-complexity further decreases to $O(n/\log k)$.

cs.NE↗

arXiv2010

Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions

With this paper, we contribute to the understanding of ant colony optimization (ACO) algorithms by formally analyzing their runtime behavior. We study simple MAX-MIN ant systems on the class of linear pseudo-Boolean functions defined on binary strings of length 'n'. Our investigations point out how the progress according to function values is stored in pheromone. We provide a general upper bound of O((n^3 \log n)/ ρ) for two ACO variants on all linear functions, where (ρ) determines the pheromone update strength. Furthermore, we show improved bounds for two well-known linear pseudo-Boolean functions called OneMax and BinVal and give additional insights using an experimental study.

cs.NE↗

arXiv2008

Chiral Partners in a Chirally Broken World

The isovector--vector and the isovector--axial-vector current are related by a chiral transformation. These currents can be called chiral partners at the fundamental level. In a world where chiral symmetry was not broken, the corresponding current-current correlators would show the same spectral information. In the real world chiral symmetry is spontaneously broken. A prominent peak -- the rho-meson -- shows up in the vector spectrum (measured in (e^+ e^-)-collisions and tau-decays). On the other hand, in the axial-vector spectrum a broad bump appears -- the a_1-meson (also accessible in tau-decays). It is tempting to call rho and a_1 chiral partners at the hadronic level. Strong indications are brought forward that these ``chiral partners'' do not only differ in mass but even in their nature: The rho-meson appears dominantly as a quark-antiquark state with small modifications from an attractive pion-pion interaction. The a_1-meson, on the other hand, can be understood as a meson-molecule state mainly formed by the attractive interaction between pion and rho-meson. A key issue here is that the meson-meson interactions are fixed by chiral symmetry breaking. It is demonstrated that one can understand the vector and the axial-vector spectrum very well within this interpretation. It is also shown that the opposite cases, namely rho as a pion-pion molecule or a_1 as a quark-antiquark state lead to less satisfying results. Finally speculations on possible in-medium changes of hadron properties are presented.

nucl-th↗

arXiv2008

Information on the structure of the a1 from tau decay

The decay $τ\to πππν$ is analysed using different methods to account for the resonance structure, which is usually ascribed to the a1. One scenario is based on the recently developed techniques to generate axial-vector resonances dynamically, whereas in a second calculation the a1 is introduced as an explicit resonance. We investigate the influence of different assumptions on the result. In the molecule scenario the spectral function is described surprisingly well by adjusting only one free parameter. This result can be systematically improved by adding higher order corrections to the iterated Weinberg-Tomozawa interaction. Treating the a1 as an explicit resonance on the other hand leads to peculiar properties.

hep-ph↗

arXiv2007

Tau decay and the structure of the a1

We analyse the decay $τ\toπππν$ based on the recently developed techniques to generate axial-vector resonances dynamically. Under the assumption that the a1 is a coupled-channel meson-molecule, the spectral function is described surprisingly well by adjusting only one free parameter. Including, in addition, an elementary a1 corrupts the results.

hep-ph↗