liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Textorius, Björn
Publications (9 of 9) Show all publications
Amankwah, H., Larsson, T. & Textorius, B. (2014). A maximum flow formulation of a multi-period open-pit mining problem. Operational Research, 14(1), 1-10
Open this publication in new window or tab >>A maximum flow formulation of a multi-period open-pit mining problem
2014 (English)In: Operational Research, ISSN 1109-2858, E-ISSN 1866-1505, Vol. 14, no 1, p. 1-10Article in journal (Refereed) Published
Abstract [en]

We consider the problem of finding an optimal mining sequence for an open pit during a number of time periods subject to only spatial and temporal precedence constraints. This problem is of interest because such constraints are generic to any open-pit scheduling problem and, in particular, because it arises as a Lagrangean relaxation of an open-pit scheduling problem. We show that this multi-period open-pit mining problem can be solved as a maximum flow problem in a time-expanded mine graph. Further, the minimum cut in this graph will define an optimal sequence of pits. This result extends a well-known result of J.-C. Picard from 1976 for the open-pit mine design problem, that is, the single-period case, to the case of multiple time periods.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2014
Keywords
Open-pit mining; Integer programming; Scheduling; Maximum flow; Maximal closure; Lagrangean relaxation
National Category
Natural Sciences
Identifiers
urn:nbn:se:liu:diva-106129 (URN)10.1007/s12351-013-0140-7 (DOI)000333172000001 ()
Available from: 2014-04-25 Created: 2014-04-24 Last updated: 2017-12-05Bibliographically approved
Amankwah, H., Larsson, T. & Textorius, B. (2013). Open-pit mining with uncertainty: A conditional value-at-risk approach. In: Athanasios Migdalas, Angelo Sifaleras, Christos K. Georgiadis, Jason Papathanasiou, Emmanuil Stiakakis (Ed.), Optimization Theory, Decision Making, and Operations Research Applications: Proceedings of the 1st International Symposium and 10th Balkan Conference on Operational Research. Paper presented at 1st International Symposium and 10th Balkan Conference on Operational Research, 22-25 September 2011, Thessaloniki, Greece (pp. 117-139). New York: Springer
Open this publication in new window or tab >>Open-pit mining with uncertainty: A conditional value-at-risk approach
2013 (English)In: Optimization Theory, Decision Making, and Operations Research Applications: Proceedings of the 1st International Symposium and 10th Balkan Conference on Operational Research / [ed] Athanasios Migdalas, Angelo Sifaleras, Christos K. Georgiadis, Jason Papathanasiou, Emmanuil Stiakakis, New York: Springer, 2013, p. 117-139Conference paper, Published paper (Refereed)
Abstract [en]

The selection of a mine design is based on estimating net present values of all possible, technically feasible mine plans so as to select the one with the maximum value. It is a hard task to know with certainty the quantity and quality of ore in the ground. This geological uncertainty and also the future market behavior of metal prices and foreign exchange rates, which are always uncertain, make mining a high risk business. Value-at-Risk (VaR) is a measure that is used in financial decisions to minimize the loss caused by inadequate monitoring of risk. This measure does, however, have certain drawbacks such as lack of consistency, nonconvexity, and nondifferentiability. Rockafellar and Uryasev [J. Risk 2, 21-41 (2000)] introduce the Conditional Value-at-Risk (CVaR) measure as an alternative to the VaR measure. The CVaR measure gives rise to a convex optimization problem. An optimization model that maximizes expected return while minimizing risk is important for the mining sector as this will help make better decisions on the blocks of ore to mine at a particular point in time. We present a CVaR approach to the uncertainty involved in open-pit mining. We formulate investment and design models for the open-pit mine and also give a nested pit scheduling model based on CVaR. Several numerical results based on our models are presented by using scenarios from simulated geological and market uncertainties.

Place, publisher, year, edition, pages
New York: Springer, 2013
Series
Springer Proceedings in Mathematics and Statistics, ISSN 2194-1009 ; 31
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-106239 (URN)10.1007/978-1-4614-5134-1_8 (DOI)978-146145133-4 (print) (ISBN)978-1-4614-5134-1 (ISBN)
Conference
1st International Symposium and 10th Balkan Conference on Operational Research, 22-25 September 2011, Thessaloniki, Greece
Available from: 2014-04-29 Created: 2014-04-29 Last updated: 2014-05-08Bibliographically approved
Textorius, B. (2005). Directing Mappings in Krein Spaces. In: Colloquium on Operator Theory on the occasion of the retirement of Heinz Langer,2004 (pp. 351). Basel: Birkhäuser
Open this publication in new window or tab >>Directing Mappings in Krein Spaces
2005 (English)In: Colloquium on Operator Theory on the occasion of the retirement of Heinz Langer,2004, Basel: Birkhäuser , 2005, p. 351-Conference paper, Published paper (Refereed)
Abstract [en]

M.G.Kreins metod med riktande avbildning utvidgas till klassen av de kvasitätt definierade symmetriska operatorer i ett indefinit inre produktrum, som har självadjungerade definitiserbara utvidgningar i något Kreinrum.

Place, publisher, year, edition, pages
Basel: Birkhäuser, 2005
Keywords
Kreinrum, riktande avbildning
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-31024 (URN)16721 (Local ID)16721 (Archive number)16721 (OAI)
Note
Operator Theory: Advances and Applications, Vol 163Available from: 2009-10-09 Created: 2009-10-09
Textorius, B. (2004). Directing mappings in Krein spaces. In: Colloquium on Operator Theory on the occasion of the retirement of Heinz Langer,2004.
Open this publication in new window or tab >>Directing mappings in Krein spaces
2004 (English)In: Colloquium on Operator Theory on the occasion of the retirement of Heinz Langer,2004, 2004Conference paper, Published paper (Other academic)
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-22523 (URN)1783 (Local ID)1783 (Archive number)1783 (OAI)
Available from: 2009-10-07 Created: 2009-10-07
Amankwah, H., Larsson, T. & Textorius, B.A Duality-Based Derivation of the Maximum Flow Formulation of the Open-Pit Design Problem.
Open this publication in new window or tab >>A Duality-Based Derivation of the Maximum Flow Formulation of the Open-Pit Design Problem
(English)Manuscript (preprint) (Other academic)
Abstract [en]

Open-pit mining is a surface mining operation whereby ore, or waste, is excavated from the surface of the land. The open-pit design problem is deciding on which blocks of an ore deposit to mine in order to maximize the total profit, while obeying digging constraints concerning pit slope and block precedence. The open-pit design problem can be formulated as a maximum flow problem in a certain capacitated network, as first shown by Picard in 1976. His derivation is based on a restatement of the problem as a quadratic binary program. We give an alternative derivation of the maximum flow formulation, which uses only linear programming duality.

Keywords
Open-pit mining, pit design, maximum flow, maximum profit, block model
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-70840 (URN)
Available from: 2011-09-20 Created: 2011-09-20 Last updated: 2013-08-30Bibliographically approved
Amankwah, H., Larsson, T. & Textorius, B.A Multi-Parametric Maximum Flow Characterization of the Open-Pit Scheduling Problem.
Open this publication in new window or tab >>A Multi-Parametric Maximum Flow Characterization of the Open-Pit Scheduling Problem
(English)Manuscript (preprint) (Other academic)
Abstract [en]

We consider the problem of finding an optimal mining schedule for an openpit during a number of time periods, subject to a mining capacity restriction for each time period. By applying Lagrangian relaxation to the capacities, a multi-parametric formulation is obtained. We show that this formulation can be restated as a maximum flow problem in a time-expanded network. This result extends a well-known result of Picard from 1976 for the open-pit design problem, that is, the single-period case, to the case of multiple time periods.

Keywords
Open-pit mining, scheduling, maximum flow, minimum cut, Lagrangian relaxation
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-70841 (URN)
Available from: 2011-09-20 Created: 2011-09-20 Last updated: 2013-08-30Bibliographically approved
Amankwah, H., Larsson, T. & Textorius, B.On the use of Parametric Open-Pit Design Models for Mine Scheduling - Pitfalls and Counterexamples.
Open this publication in new window or tab >>On the use of Parametric Open-Pit Design Models for Mine Scheduling - Pitfalls and Counterexamples
(English)Manuscript (preprint) (Other academic)
Abstract [en]

This paper discusses a Lagrangian relaxation interpretation of the Picard and Smith (2004) parametric approach to open-pit mining, which finds a sequence of intermediate contours leading to an ultimate one. This method is similar to the well known parametric approach of Lerchs and Grossmann (1965). We give examples of worst case performance, as well as best case performance of the Picard-Smith approach. The worst case behaviour can be very poor in that we might not obtain any intermediate contours at all. We also discuss alternative parametric methods for finding intermediate contours, but conclude that such methods seem to have inherent weaknesses.

Keywords
Open-pit mining, Picard-Smith model, Lagrangian relaxation, pit design, block value, scheduling
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-70838 (URN)
Available from: 2011-09-20 Created: 2011-09-20 Last updated: 2013-08-30Bibliographically approved
Amankwah, H., Larsson, T. & Textorius, B.Open-Pit Mining with Uncertainty - A Conditional Value-at-Risk Approach.
Open this publication in new window or tab >>Open-Pit Mining with Uncertainty - A Conditional Value-at-Risk Approach
(English)Manuscript (preprint) (Other academic)
Abstract [en]

The selection of a mine design is based on estimating net present values of all possible, technically feasible mine plans so as to select the one with the maximum value. It is a hard task to know with certainty the quantity and quality of ore in the ground. This geological uncertainty, and also the future market behaviour of metal prices and foreign exchange rates, which are impossible to be known with certainty, make mining a high risk business.

Value-at-Risk (VaR) is a measure that is used in financial decisions to minimize the loss caused by inadequate monitoring of risk. This measure does however have certain drawbacks such as lack of consistency, nonconvexity, and nondifferentiability. Rockafellar and Uryasev (2000) introduce the Conditional Value-at-Risk (CVaR) measure as an alternative to the VaR measure. The CVaR measure gives rise to a convex problem.

An optimization model that maximizes expected return while minimizing risk is important for the mining sector as this will help make better decisions on the blocks of ore to mine at a particular point in time. We present a CVaR approach to the uncertainty involved in open-pit mining. We formulate investment and design models for the open-pit mine and also give a nested pit scheduling model based on CVaR. Several numerical results based on our models are presented by using scenarios from simulated geological and price uncertainties.

Keywords
Conditional value-at-risk (CVaR), open-pit mining, geological uncertainty, price uncertainty
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-70843 (URN)
Available from: 2011-09-20 Created: 2011-09-20 Last updated: 2013-08-30Bibliographically approved
Amankwah, H., Larsson, T., Textorius, B. & Rönnberg, E.Open-Pit Production Scheduling - Suggestions for Lagrangian Dual Heuristic and Time Aggregation Approaches.
Open this publication in new window or tab >>Open-Pit Production Scheduling - Suggestions for Lagrangian Dual Heuristic and Time Aggregation Approaches
(English)Manuscript (preprint) (Other academic)
Abstract [en]

Open-pit production scheduling deals with the problem of deciding what and when to mine from an open-pit, given potential profits of the different fractions of the mining volume, pit-slope restrictions, and mining capacity restrictions for successive time periods. We give suggestions for Lagrangian dual heuristic approaches for the open-pit production scheduling problem. First, the case with a single mining capacity restriction per time period is considered. For this case, linear programming relaxations are solved to find values of the multipliers for the capacity restrictions, to be used in a Lagrangian relaxation of the constraints. The solution to the relaxed problem will not in general satisfy the capacity restrictions, but can be made feasible by adjusting the multiplier values for one time period at a time. Further, a time aggregation approach is suggested as a way of reducing the computational burden of solving linear programming relaxations, especially for largescale real-life mine problems. For the case with multiple capacity restrictions per time period we apply newly developed conditions for optimality and nearoptimality in general discrete optimization problems to construct a procedure for heuristically constructing near-optimal intermediate pits.

Keywords
Open-pit mining, mine scheduling, Lagrangian relaxation, maximum flow, time aggregation
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-70842 (URN)
Available from: 2011-09-20 Created: 2011-09-20 Last updated: 2018-06-25Bibliographically approved
Organisations

Search in DiVA

Show all publications