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

TL;DR

This paper extends stockyard recovery scheduling to multiple reclaimers, addressing their interactions, safety, and mineral handling, and proposes algorithms including ACO and local search for efficient scheduling.

Contribution

It introduces a multi-reclaimer scheduling framework with realistic constraints and compares advanced algorithms, notably combining ACO with local search for improved solutions.

Findings

ACO with local search outperforms other methods

Proposed algorithms effectively handle multiple reclaimers and constraints

Scheduling solutions improve efficiency and safety in stockyard operations

Abstract

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 stockpile managers where failure to meet some requirements can lead to losing money. This problem was recently investigated using a single reclaimer, and basic assumptions. This study extends the approach to consider multiple reclaimers in preparing for short and long-term deliveries. The engagement of multiple reclaimers complicates the problem in terms of their interaction in preparing a delivery simultaneously and safety distancing of reclaimers. We also consider more realistic settings, such as handling different minerals with different types of reclaimers. We propose methods that construct a solution step by step to meet precedence constraints for all reclaimers in the stockyard. We study various instances of the problem using greedy algorithms, Ant Colony Optimisation (ACO), and propose an integrated local search method determining an efficient schedule. We fine-tune and compare the algorithms and show that the ACO combined with local search can yield efficient solutions.