## Algorithms for the power-\$ Steiner tree problem in the Euclidean plane

We study the problem of constructing minimum power-\$p\$ Euclidean \$k\$-Steiner trees in the plane. The problem is to find a tree of minimum cost spanning a set of given terminals where, as opposed to the minimum spanning tree problem, at most \$k\$ additional nodes (Steiner points) may be introduced anywhere in the plane. The cost … Read more

## Approximate Uni-directional Benders Decomposition

We examine a decomposition approach to find good quality feasible solutions. In particular, we study a method to reduce the search-space by decomposing a problem into two partitions, where the second partition (i.e., the subproblem) contains the fixed solution of the first (i.e., the master). This type of approach is usually motivated by the presence … Read more

## Scheduling with Fixed Maintenance, Shared Resources and Nonlinear Feedrate Constraints: a Mine Planning Case Study

Given a short term mining plan, the task for an operational mine planner is to determine how the equipment in the mine should be used each day. That is, how crushers, loaders and trucks should be used to realise the short term plan. It is important to achieve both grade targets (by blending) and maximise … Read more

## An MILP approach to Multi-location, Multi-Period Equipment Selection for Surface Mining with Case Studies

In the surface mining industry, the Equipment Selection Problem involves choosing an appropriate fleet of trucks and loaders such that the long-term mine plan can be satisfied. An important characteristic for multi-location (multi-location and multi-dumpsite) mines is that the underlying problem is a multi-commodity flow problem. The problem is therefore at least as difficult as … Read more

## Planning for Mining Operations with Time and Resource Constraints

We study a daily mine planning problem where, given a set of blocks we wish to mine, our task is to generate a mining sequence for the excavators such that blending resource constraints are met at various stages of the sequence. Such time-oriented resource constraints are not traditionally handled well by automated planners. On the … Read more

## An MILP approach to Multi-location, Multi-Period Equipment Selection for Surface Mining with Case Studies

In the surface mining industry, the Equipment Selection Problem involves choosing an appropriate fleet of trucks and loaders such that the long-term mine plan can be satisfied. An important characteristic for multi-location (multi-location and multi-dumpsite) mines is that the underlying problem is a multi-commodity flow problem. The problem is therefore at least as difficult as … Read more

## Equipment Selection for Surface Mining: A Review

One of the challenging problems for surface mining operation optimization is choosing the optimal truck and loader fleet. This problem is the Equipment Selection Problem (ESP). In this paper, we describe the ESP in the context of surface mining. We discuss related problems and applications. Within the scope of both the ESP and related problems, … Read more