Markus Wagner

Markus Wagner
University of Adelaide · School of Computer Science

PhD, University Doctoral Research Medal

About

253
Publications
85,331
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
2,689
Citations
Introduction
Share, highlight, teach, innovate. Senior Lecturer at University of Adelaide. Optimisation Engineer. I am a passionate problem solver, I am looking for challenges, and I am not familiar with the term "I can't". Specialties: • Optimisation: problem analysis, development of suitable (multi-objective) optimisation algorithms, team coordination, and process documentation (since 2006) • Applications: renewable energy production (wave energy and wind energy), search-based software engineering, and professional team cycling (since 2010), now also getting into mining (ore tracking and blending, since 2017) Through my professional activities (over 100 papers with over 100 co-authors) and my volunteering activities (IEEE CIS, AIESEC) I am well connected.
Additional affiliations
January 2021 - present
University of Adelaide
Position
  • Professor (Associate)
January 2017 - December 2020
University of Adelaide
Position
  • Lecturer
March 2013 - present
University of Adelaide
Position
  • Lecturer

Publications

Publications (253)
Conference Paper
Full-text available
Multi-objective optimization problems arise frequently in applications but can often only be solved approximately by heuristic approaches. Evolutionary algorithms have been widely used to tackle multi-objective problems. These algorithms use different measures to ensure diversity in the objective space but are not guided by a formal notion of appro...
Article
Full-text available
Multi-objective optimization problems having more than three objectives are referred to as many-objective optimization problems. Many-objective optimization brings with it a number of challenges that must be addressed, which highlights the need for new and better algorithms that can efficiently handle the growing number of objectives. This article...
Article
Full-text available
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 persp...
Article
Full-text available
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 conditions present at its site. If the output can be predicted more accurately, energy suppliers can coordinate the collaborative production of different energy sources more efficiently to avoid costly overpro...
Article
Full-text available
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 minim...
Preprint
GitHub is the largest host of open source software on the Internet. This large, freely accessible database has attracted the attention of practitioners and researchers alike. But as GitHub's growth continues, it is becoming increasingly hard to navigate the plethora of repositories which span a wide range of domains. Past work has shown that taking...
Article
Context Championed by IBM’s vision of autonomic computing paper in 2003, the autonomic computing research field has seen increased research activity over the last 20 years. Several conferences (SEAMS, SASO, ICAC) and workshops (SISSY) have been established and have contributed to the autonomic computing knowledge base in search of a new kind of sys...
Preprint
Full-text available
Background. From information theory, surprisal is a measurement of how unexpected an event is. Statistical language models provide a probabilistic approximation of natural languages, and because surprisal is constructed with the probability of an event occuring, it is therefore possible to determine the surprisal associated with English sentences....
Article
Full-text available
Following decades of sustained improvement, metaheuristics are one of the great success stories of optimization research. However, in order for research in metaheuristics to avoid fragmentation and a lack of reproducibility, there is a pressing need for stronger scientific and computational infrastructure to support the development, analysis and co...
Preprint
Full-text available
Since its inception in 2013, the Travelling Thief Problem (TTP) has been widely studied as an example of problems with multiple interconnected sub-problems. The dependency in this model arises when tying the travelling time of the "thief" to the weight of the knapsack. However, other forms of dependency as well as combinations of dependencies shoul...
Preprint
Full-text available
Software developers are increasingly dependent on question and answer portals and blogs for coding solutions. While such interfaces provide useful information, there are concerns that code hosted here is often incorrect, insecure or incomplete. Previous work indeed detected a range of faults in code provided on Stack Overflow through the use of sta...
Preprint
Full-text available
Online participant recruitment platforms such as Prolific have been gaining popularity in research, as they enable researchers to easily access large pools of participants. However, participant quality can be an issue; participants may give incorrect information to gain access to more studies, adding unwanted noise to results. This paper details ou...
Preprint
Full-text available
Stockpiles are essential in the mining value chain, assisting in maximising value and production. Quality control of taken minerals from the stockpiles is a major concern for stockpile managers where failure to meet some requirements can lead to losing money. This problem was recently investigated using a single reclaimer, and basic assumptions. Th...
Preprint
Full-text available
Topology optimisation of trusses can be formulated as a combinatorial and multi-modal problem in which locating distinct optimal designs allows practitioners to choose the best design based on their preferences. Bilevel optimisation has been successfully applied to truss optimisation to consider topology and sizing in upper and lower levels, respec...
Article
Full-text available
During the evolutionary process, algorithms based on probability distributions for generating new individuals suffer from computational burden due to the intensive computation of probability distribution estimations, particularly when using Probabilistic Graph Models (PGMs). In the Bayesian Optimisation Algorithm (BOA), for instance, determining th...
Article
Full-text available
We tackle the thief orienteering problem (ThOP), an academic multi-component problem that combines two classical combinatorial problems, namely the Knapsack Problem and the Orienteering Problem. In the ThOP, a thief has a time limit to steal items that distributed in a given set of cities. While traveling, the thief collects items by storing them i...
Preprint
Full-text available
Side-channel attacks are a major threat to the security of cryptographic implementations, particularly for small devices that are under the physical control of the adversary. While several strategies for protecting against side-channel attacks exist, these often fail in practice due to unintended interactions between values deep within the CPU. To...
Preprint
Full-text available
We tackle the Thief Orienteering Problem (ThOP), an academic multi-component problem that combines two classical combinatorial problems, namely the Knapsack Problem and the Orienteering Problem. In the ThOP, a thief has a time limit to steal items that distributed in a given set of cities. While traveling, the thief collects items by storing them i...
Article
Full-text available
A core operator of evolutionary algorithms (EAs) is the mutation. Recently, much attention has been devoted to the study of mutation operators with dynamic and non-uniform mutation rates. Following up on this area of work, we propose a new mutation operator and analyze its performance on the \((1+1)\) Evolutionary Algorithm (EA). Our analyses show...
Article
Full-text available
Many real-world optimization problems have multiple interacting components. Each of these can be an NP-hard problem, and they can be in conflict with each other, i.e., the optimal solution for one component does not necessarily represent an optimal solution for the other components. This can be a challenge for single-objective formulations, where t...
Preprint
Full-text available
Cloud and edge computing have been widely adopted in many application scenarios. With the increasing demand of fast iteration and complexity of business logic, it is challenging to achieve rapid development and continuous delivery in such highly distributed cloud and edge computing environment. At present, microservice-based architecture has been t...
Preprint
Full-text available
The Node.js Package Manager (i.e., npm) archive repository serves as a critical part of the JavaScript community and helps support one of the largest developer ecosystems in the world. However, as a developer, selecting an appropriate npm package to use or contribute to can be difficult. To understand what features users and contributors consider i...
Article
Full-text available
In this paper, we propose a method to solve a bi-objective variant of the well-studied traveling thief problem (TTP). The TTP is a multi-component problem that combines two classic combinatorial problems: traveling salesman problem and knapsack problem. We address the BI-TTP, a bi-objective version of the TTP, where the goal is to minimize the over...
Article
Full-text available
This contribution introduces the GTOPX space mission benchmark collection, which is an extension of the GTOP database published by the European Space Agency (ESA). The term GTOPX stands for Global Trajectory Optimization Problems with eXtension. GTOPX consists of ten individual benchmark instances representing real-world interplanetary space trajec...
Article
Full-text available
Due to expanding global environmental issues and growing energy demand, wind power technologies have been studied extensively. Accurate and robust short-term wind speed forecasting is crucial for large-scale integration of wind power generation into the power grid. However, the seasonal and stochastic characteristics of wind speed make forecasting...
Preprint
Full-text available
In recent years, Evolutionary Algorithms (EAs) have frequently been adopted to evolve instances for optimization problems that pose difficulties for one algorithm while being rather easy for a competitor and vice versa. Typically, this is achieved by either minimizing or maximizing the performance difference or ratio which serves as the fitness fun...
Article
Full-text available
Boolean functions have numerous applications in domains as diverse as coding theory, cryptography, and telecommunications. Heuristics play an important role in the construction of Boolean functions with the desired properties for a specific purpose. However, there are only sparse results trying to understand the problem’s difficulty. With this work...
Article
Full-text available
Short-term wind power prediction is challenging due to the chaotic characteristics of wind speed. Since, for wind power industries, designing an accurate and reliable wind power forecasting model is essential, we deployed a novel composite deep learning-based evolutionary approach for accurate forecasting of the power output in wind-turbine farms,...
Chapter
Full-text available
In this paper, we introduce a Model-based Algorithm Tuning Engine, namely MATE, where the parameters of an algorithm are represented as expressions of the features of a target optimisation problem. In contrast to most static (feature-independent) algorithm tuning engines such as irace and SPOT, our approach aims to derive the best parameter configu...
Preprint
Full-text available
Code reuse is an important part of software development. The adoption of code reuse practices is especially noticeable in Node.js. The Node.js package manager, NPM, contains over 1 Million packages and developers often seek out packages to solve programming tasks. Due to the vast number of packages, selecting the right package is difficult and time...
Preprint
Full-text available
Championed by IBM's vision of autonomic computing paper in 2003, the autonomic computing research field has seen increased research activity over the last 20 years. Several conferences (SEAMS, SASO, ICAC) and workshops (SISSY) have been established and have contributed to the autonomic computing knowledge base in search of a new kind of system -- a...
Preprint
Full-text available
Following decades of sustained improvement, metaheuristics are one of the great success stories of optimization research. However, in order for research in metaheuristics to avoid fragmentation and a lack of reproducibility, there is a pressing need for stronger scientific and computational infrastructure to support the development, analysis and co...
Preprint
Full-text available
Many real-world optimization problems have multiple interacting components. Each of these can be NP-hard and they can be in conflict with each other, i.e., the optimal solution for one component does not necessarily represent an optimal solution for the other components. This can be a challenge for single-objective formulations, where the respecti...
Chapter
Full-text available
Many real-world optimisation problems involve dynamic and stochastic components. While problems with multiple interacting components are omnipresent in inherently dynamic domains like supply-chain optimisation and logistics, most research on dynamic problems focuses on single-component problems. With this article, we define a number of scenarios ba...
Article
Full-text available
To advance commercialisation of ocean wave energy and for the technology to become competitive with other sources of renewable energy, the cost of wave energy harvesting should be significantly reduced. The Mediterranean Sea is a region with a relatively low wave energy potential, but due to the absence of extreme waves, can be considered at the in...
Preprint
Full-text available
This contribution introduces the GTOPX space mission benchmark collection, which is an extension of GTOP database published by the European Space Agency (ESA). GTOPX consists of ten individual benchmark instances representing real-world interplanetary space trajectory design problems. In regard to the original GTOP collection, GTOPX includes three...
Article
Following Prof. Mark Harman of Facebook's keynote and formal presentations (which are recorded in the proceed- ings) there was a wide ranging discussion at the eighth inter- national Genetic Improvement workshop, GI-2020 @ ICSE (held as part of the International Conference on Software En- gineering on Friday 3rd July 2020). Topics included industry...
Conference Paper
Following Prof. Mark Harman of Facebook's keynote and formal presentations (which are recorded in the proceedings) there was a wide ranging discussion at the eighth international Genetic Improvement workshop, GI-2020 @ ICSE (held as part of the 42nd ACM/IEEE International Conference on Software Engineering on Friday 3rd July 2020). Topics included...
Chapter
Full-text available
Genetic programming is an often-used technique for symbolic regression: finding symbolic expressions that match data from an unknown function. To make the symbolic regression more efficient, one can also use dimensionally-aware genetic programming that constrains the physical units of the equation. Nevertheless, there is no formal analysis of how m...