ORCID Profile
0000-0003-0695-6356
Current Organisation
Fortescue Metals Group
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Informa UK Limited
Date: 12-2007
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer International Publishing
Date: 2018
Publisher: Universidade Federal do Rio Grande do Sul
Date: 19-11-2018
Abstract: 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 of an edge is its length to the power of $p$ (where $p\geq 1$), and the cost of a network is the sum of all edge costs. We propose two heuristics: a ``beaded" minimum spanning tree heuristic and a heuristic which alternates between minimum spanning tree construction and a local fixed topology minimisation procedure for locating the Steiner points. We show that the performance ratio $\kappa$ of the beaded-MST heuristic satisfies $\sqrt{3}^{p-1}(1+2^{1-p})\leq \kappa\leq 3(2^{p-1})$. We then provide two mixed-integer nonlinear programming formulations for the problem, and extend several important geometric properties into valid inequalities. Finally, we combine the valid inequalities with warm-starting and preprocessing to obtain computational improvements for the $p=2$ case.
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 04-2014
Abstract: One of the challenging problems for surface mining operation optimization is choosing the optimal truck and loader fleet. We refer to this problem as the equipment selection problem (ESP). In this paper, we describe the ESP in the context of surface mining and discuss related problems and applications. Within the scope of both the ESP and related problems, we outline modeling and solution approaches. Using operations research literature as a guide, we conclude by pointing to future research directions to improve both the modeling and solution outcomes for practical applications of this problem.
Publisher: Informa UK Limited
Date: 08-2011
Publisher: American Institute of Mathematical Sciences (AIMS)
Date: 06-2015
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: IEEE
Date: 09-2008
Publisher: Modelling and Simulation Society of Australia and New Zealand
Date: 12-2019
Publisher: Springer International Publishing
Date: 2018
Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
Date: 11-2014
Abstract: We consider the short-term production scheduling problem for a network of multiple open-pit mines and ports. Ore produced at each mine is transported by rail to a set of ports and blended into signature products for shipping. Consistency in the grade and quality of production over time is critical for customer satisfaction, whereas the maximal production of blended products is required to maximise profit. In practice, short-term schedules are formed independently at each mine, tasked with achieving the grade and quality targets outlined in a medium-term plan. However, because of uncertainty in the data available to a medium-term planner and the dynamics of the mining environment, such targets may not be feasible in the short term. We present a decomposition-based heuristic for this short-term scheduling problem in which the grade and quality goals assigned to each mine are collaboratively adapted—ensuring the satisfaction of blending constraints at each port and exploiting opportunities to maximise production in the network that would otherwise be missed.
Publisher: Informa UK Limited
Date: 12-2007
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: American Institute of Mathematical Sciences (AIMS)
Date: 06-2015
Location: United Kingdom of Great Britain and Northern Ireland
Start Date: 2018
End Date: End date not available
Funder: Innovate UK
View Funded Activity