activity
20102022
most citedMetaheuristics "In the Large"

88 citations · 331 across the 43 of their papers we have counts for

collaborators
Showing cs.NEShow all

30 papers · 1 filter

cs.NE2021

Run-of-Mine Stockyard Recovery Scheduling and Optimisation for Multiple Reclaimers

Hirad Assimi, Ben Koch, Chris Garcia +2

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 stock…

cs.NE2021

Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems

Hirad Assimi, Frank Neumann, Markus Wagner +1

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 des…

cs.NE2021

Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach

Jonatas B. C. Chagas, Markus Wagner

We tackle the Thief Orienteering Problem (ThOP), an academic multi-component problem that combines two classical combinatorial problems, namely the Knapsack Problem and the Oriente…

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.NE2020

A weighted-sum method for solving the bi-objective traveling thief problem

Jonatas B. C. Chagas, Markus Wagner

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…

cs.NE2020★ 14 cited

GTOPX Space Mission Benchmarks

Martin Schlueter, Mehdi Neshat, Mohamed Wahib +2

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 te…