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

no code implementations • 23 Dec 2021 • Hirad Assimi, Ben Koch, Chris Garcia, Markus Wagner, Frank Neumann

Stockpiles are essential in the mining value chain, assisting in maximising value and production.

Scheduling

Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems

1 code implementation • 15 Dec 2021 • Hirad Assimi, Frank Neumann, Markus Wagner, XiaoDong Li

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.

Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives

no code implementations • 17 Feb 2020 • Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, Frank Neumann

In this paper, we consider the dynamic chance-constrained knapsack problem where the weight of each item is stochastic, the capacity constraint changes dynamically over time, and the objective is to maximize the total profit subject to the probability that total weight exceeds the capacity.

Combinatorial Optimization Evolutionary Algorithms

Evolutionary Algorithms for the Chance-Constrained Knapsack Problem

no code implementations • 13 Feb 2019 • Yue Xie, Oscar Harper, Hirad Assimi, Aneta Neumann, Frank Neumann

In the experiment section, we evaluate and compare the deterministic approaches and evolutionary algorithms on a wide range of instances.

Evolutionary Algorithms