activity
20152022
most citedMOLE: Digging Tunnels Through Multimodal Multi-Objective Landscapes

9 citations · 10 across the 6 of their papers we have counts for

collaborators
Showing cs.NEShow all

6 papers · 1 filter

cs.NE2020

To Boldly Show What No One Has Seen Before: A Dashboard for Visualizing Multi-objective Landscapes

Lennart Schäpermeier, Christian Grimme, Pascal Kerschke

Simultaneously visualizing the decision and objective space of continuous multi-objective optimization problems (MOPs) recently provided key contributions in understanding the stru…

cs.NE2020

Multiobjectivization of Local Search: Single-Objective Optimization Benefits From Multi-Objective Gradient Descent

Vera Steinhoff, Pascal Kerschke, Pelin Aspar +2

Multimodality is one of the biggest difficulties for optimization as local optima are often preventing algorithms from making progress. This does not only challenge local strategie…

cs.NE2020

Empirical Study on the Benefits of Multiobjectivization for Solving Single-Objective Problems

Vera Steinhoff, Pascal Kerschke, Christian Grimme

When dealing with continuous single-objective problems, multimodality poses one of the biggest difficulties for global optimization. Local optima are often preventing algorithms fr…

cs.NE2020

One PLOT to Show Them All: Visualization of Efficient Sets in Multi-Objective Landscapes

Lennart Schäpermeier, Christian Grimme, Pascal Kerschke

Visualization techniques for the decision space of continuous multi-objective optimization problems (MOPs) are rather scarce in research. For long, all techniques focused on global…

cs.NE20201 cited

Dynamic Bi-Objective Routing of Multiple Vehicles

Jakob Bossek, Christian Grimme, Heike Trautmann

In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems (VRPs) often imply repeated decision making on dynamic customer requests. As in classical VRPs, tours…

cs.NE2020

Towards Decision Support in Dynamic Bi-Objective Vehicle Routing

Jakob Bossek, Christian Grimme, Günter Rudolph +1

We consider a dynamic bi-objective vehicle routing problem, where a subset of customers ask for service over time. Therein, the distance traveled by a single vehicle and the number…