Additional Material
The following sections provide additional material on some of our current research projects.

Multimodal MultiObjective Optimization
This project is based on joint work of members from our group (Information Systems and Statistics) and the "Leiden Institute of Advanced Computer Science" (LIACS). Our findings are collected in a paper called "Search Dynamics on Multimodal MultiObjective Problems", which was accepted for publication in the Evolutionary Computation Journal (ECJ) in September 2018. The manuscript combines and extends work from our (best) paper on "Towards Analyzing Multimodality of Multiobjective Landscapes" (published at the 14th International Conference on Parallel Problem Solving from Nature (PPSN XIV)), as well as our papers on "An Expedition to Multimodal MultiObjective Optimization Landscapes" and "Hypervolume Indicator Gradient Ascent Multiobjective Optimization", both published at the 9th International Conference on Evolutionary MultiCriterion Optimization (EMO 2017).
The table below provides information on the 40 problem instances from our biobjective mixedsphere / mixedellipsoid benchmark. Each of the problems is a combination of two singleobjectives problems, created using the MPM2 generator (Wessing, 2015). Those problems can for instance be created using the Rpackage smoof 1.5 (Bossek, 2017) or the python package optproblems 0.9 (Wessing, 2016). The columns of the table describe the following:
 ID of the benchmark problem (a value between 1 and 40)
 Problem Setup, i.e., the parameters for configuring each of the two objectives per instance:
 Shape of the Peaks:
Shape of the contour lines of the peaks (either "ellipse" or "sphere").  Rotate Peaks:
Should the peak shapes be rotated (TRUE / FALSE)? This parameter is only useful, if the peak shape is "ellipse".  Problem Dimension:
Number of input input parameters (i.e., dimensions of the search space).  Topology:
How should the peaks be aligned per objective? Possible values are "random" or "funnel".  # Peaks:
The number of peaks for each of the two objectives.  Seed:
The seed that was used for generating each of the singleobjective functions
 Shape of the Peaks:
 Visual Results:
 Heatmap:
A heatmap visualizing the cumulated length of the gradient paths (either in a regular coloring scheme or based on a logscale)  Objective Space:
 theoretical:
The location of the theoretically true local efficient sets  regular / logscale:
A mapping of the heatmapcoloring for each point from the decision space to the corresponding image in the objective space (using the coloring based on the actual cumulated path length or using a logscaled version of the path lengths).
 theoretical:
 Legend Color Bar:
A legend of the coloring that was used within the heatmaps and/or the figures of the objective space.  Algorithm Behaviour:
Trace of the population (shown within the decision and objective space) for two optimization algorithms (HIGAMO and SLS). The traces are available as a pngimage or a zipped movie.
 Heatmap:
In addition to the visual results shown above, we also computed problem characteristics (so to say, "whitebox landscape features"), as well as algorithm characteristics (for HIGAMO and SLS) for each of the 40 benchmark instances. Based on these problem and lanscape characteristics, we performed a principal component analysis (PCA) and had a look at the respective biplots: one biplot across all characteristics, one for the problem characteristcs, one for the algorithm characteristics of HIGAMO and one for the ones of SLS.

Algorithm Selection on Traveling Salesperson Problems (TSP)
This is joint work of members from our group (Information Systems and Statistics) and colleagues from the Computer Science Department of the University of British Columbia.
As a first result of this fruitful collaboration, we have published a paper on "Improving the State of the Art in Inexact TSP Solving using PerInstance Algorithm Selection" at the Learning and Intelligent OptimizatioN Conference (LION9) in Lille, France. Furthermore, we have implemented two Rpackages that on the one hand provide the methods for generating clustered TSP instances (netgen) and on the other hand offer a comprehensive toolbox for solving and analyzing symmetric Travelling Salesperson Problems (salesperson).
In August 2017, our paper on "Leveraging TSP Solver Complementarity through Machine Learning" has been accepted for publication in the Evolutionary Computation Journal (ECJ).
Further information on this very interesting topic can be found on our project's website.