activity
20112020
most citedMetaheuristics "In the Large"

88 citations · 177 across the 11 of their papers we have counts for

collaborators

11 papers

cs.NE2020★ 88 cited

Metaheuristics "In the Large"

Jerry Swan, Steven Adriaensen, Alexander E. I. Brownlee +13

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…

cs.DB2019

From Digitalization to Data-Driven Decision Making in Container Terminals

Leonard Heilig, Robert Stahlbock, Stefan Voß

With the new opportunities emerging from the current wave of digitalization, terminal planning and management need to be revisited by taking a data-driven perspective. Business ana…

cs.AI2018

Fixed set search applied to the traveling salesman problem

Raka Jovanovic, Milan Tuba, Stefan Voss

In this paper we present a new population based metaheuristic called the fixed set search (FSS). The proposed approach represents a method of adding a learning mechanism to the gre…

cs.DM2016

A GRASP approach for solving the 2-connected m-dominating set problem

Raka Jovanovic, Islam Safak Bayram, Stefan Voss

In this paper, we present a constructive heuristic algorithm for the -connected -dominating set problem. It is based on a greedy heuristic in which a 2-connected subgraph is…

cs.DM2016★ 1 cited

A heuristic approach for dividing graphs into bi-connected components with a size constraint

Raka Jovanovic, Tatsushi Nishi, Stefan Voss

In this paper we propose a new problem of finding the maximal bi-connected partitioning of a graph with a size constraint (MBCPG-SC). With the goal of finding approximate solutions…

cs.AI2015★ 31 cited

An Ant Colony Optimization Algorithm for Partitioning Graphs with Supply and Demand

Raka Jovanovic, Milan Tuba, Stefan Voss

In this paper we focus on finding high quality solutions for the problem of maximum partitioning of graphs with supply and demand (MPGSD). There is a growing interest for the MPGSD…