Mustafa Kumral
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mustafa Kumral has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Peter Alan Dowd
Adelaide University
1 shared publication
Latest Publications
- 1 January 2011
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 62 (1) , 60-68
Incorporating geo-metallurgical information into mine production scheduling
Economic characterization of mining parcels depends upon geo-metallurgical properties, which vary throughout orebody. Mine production scheduling should aim to obtain maximum utility from orebody in su
- 1 January 2011
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 62 (1) , 60-68
Incorporating geo-metallurgical information into mine production scheduling
Economic characterization of mining parcels depends upon geo-metallurgical properties, which vary throughout orebody. Mine production scheduling should aim to obtain maximum utility from orebody in su
- 8 April 2010
- Published by Taylor & Francis in Engineering Optimization
- Vol. 42 (6) , 567-579
Robust stochastic mine production scheduling
The production scheduling of open pit mines aims to determine the extraction sequence of blocks such that the net present value (NPV) of a mining project is maximized under capacity and access constraints. This sequencing has significant effect on the profitability of the mining venture. However, given that the values of coefficients in the optimization procedure are obtained in a medium of sparse data and unknown future events, implementations based on deterministic models may lead to destructive consequences to the company. In this article, a robust stochastic optimization (RSO) approach is used to deal with mine production scheduling in a manner such that the solution is insensitive to changes in input data. The approach seeks a trade off between optimality and feasibility. The model is demonstrated on a case study. The findings showed that the approach can be used in mine production scheduling problems efficiently.
- 8 April 2010
- Published by Taylor & Francis in Engineering Optimization
- Vol. 42 (6) , 567-579
Robust stochastic mine production scheduling
The production scheduling of open pit mines aims to determine the extraction sequence of blocks such that the net present value (NPV) of a mining project is maximized under capacity and access constraints. This sequencing has significant effect on the profitability of the mining venture. However, given that the values of coefficients in the optimization procedure are obtained in a medium of sparse data and unknown future events, implementations based on deterministic models may lead to destructive consequences to the company. In this article, a robust stochastic optimization (RSO) approach is used to deal with mine production scheduling in a manner such that the solution is insensitive to changes in input data. The approach seeks a trade off between optimality and feasibility. The model is demonstrated on a case study. The findings showed that the approach can be used in mine production scheduling problems efficiently.
- 1 August 2005
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 56 (8) , 922-930
A simulated annealing approach to mine production scheduling
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.
- 1 August 2005
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 56 (8) , 922-930
A simulated annealing approach to mine production scheduling
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.
- 31 May 2005
- Published by Elsevier in Journal of Loss Prevention in the Process Industries
- Vol. 18 (3) , 186-189
Reliability-based optimisation of a mine production system using genetic algorithms
- 31 May 2005
- Published by Elsevier in Journal of Loss Prevention in the Process Industries
- Vol. 18 (3) , 186-189
Reliability-based optimisation of a mine production system using genetic algorithms
- 1 January 2004
- Published by Taylor & Francis in Production Planning & Control
- Vol. 15 (1) , 34-41
Genetic algorithms for optimization of a mine system under uncertainty
The production planning of a mine system associated with mining, processing and refining stages dictates to determine optimal system parameters such as optimal production rates, location of refining facility and the best reconstruction time of production rates. This paper proposes a combination of the chance constrained programming (CCP) and the genetic algorithms (GA) to find the optimal system parameters simultaneously. In generic form the problem is expressed as the maximization of net present value of future cash flows such that the capacity constraint and predefined specifications are satisfied. The blending requirements expressed in the CCP are transformed into deterministic equivalents. A new form of the problem is solved by the GA. The approach was demonstrated on extraction, processing and refining of four iron ore mines with varying reserves, ore qualities, geological and topographic conditions, four mineral processing units and one refining facility. The results showed that the proposed algorithm could be used to determine optimal production rates, the facility location and the best reconstruction time.
- 1 January 2004
- Published by Taylor & Francis in Production Planning & Control
- Vol. 15 (1) , 34-41
Genetic algorithms for optimization of a mine system under uncertainty
The production planning of a mine system associated with mining, processing and refining stages dictates to determine optimal system parameters such as optimal production rates, location of refining facility and the best reconstruction time of production rates. This paper proposes a combination of the chance constrained programming (CCP) and the genetic algorithms (GA) to find the optimal system parameters simultaneously. In generic form the problem is expressed as the maximization of net present value of future cash flows such that the capacity constraint and predefined specifications are satisfied. The blending requirements expressed in the CCP are transformed into deterministic equivalents. A new form of the problem is solved by the GA. The approach was demonstrated on extraction, processing and refining of four iron ore mines with varying reserves, ore qualities, geological and topographic conditions, four mineral processing units and one refining facility. The results showed that the proposed algorithm could be used to determine optimal production rates, the facility location and the best reconstruction time.
- 1 December 2003
- Published by Taylor & Francis in Engineering Optimization
- Vol. 35 (6) , 661-673
Application of chance-constrained programming based on multi-objective simulated annealing to solve a mineral blending problem
This paper addresses the optimal blending of different available ores in such a way that the total expected cost of buying ore is minimized while satisfying the quality specifications. The risk limitation criterion used consists of the simultaneous minimization of the variance of the total cost. The problem is solved by Chance-Constrained Programming (CCP) based on multi-objective simulated annealing. The technique is able to deal with the stochastic nature of the variables in the blending problem. In generic form the objectives are to minimize expected value and standard deviation of cost in such a way as to meet the blend requirements within the specified reliability level. The variability of each variable in each flow is quantified by semi-variograms. Each flow is simulated to reproduce the characteristics, or behaviour, of the phenomenon as observed in the available data. The expected value of each variable in each flow is calculated by averaging of the simulated values. The problem expressed in terms of CCP is transformed into an appropriate deterministic equivalent, which is a non-linear optimization problem. The new form of the problem is solved by multi-objective simulated annealing. A case study is carried out to demonstrate the technique. The problem is formulated in terms of iron, silica and alumina grades with four ore sources. Pros and cons of the technique are discussed.
- 1 December 2003
- Published by Taylor & Francis in Engineering Optimization
- Vol. 35 (6) , 661-673
Application of chance-constrained programming based on multi-objective simulated annealing to solve a mineral blending problem
This paper addresses the optimal blending of different available ores in such a way that the total expected cost of buying ore is minimized while satisfying the quality specifications. The risk limitation criterion used consists of the simultaneous minimization of the variance of the total cost. The problem is solved by Chance-Constrained Programming (CCP) based on multi-objective simulated annealing. The technique is able to deal with the stochastic nature of the variables in the blending problem. In generic form the objectives are to minimize expected value and standard deviation of cost in such a way as to meet the blend requirements within the specified reliability level. The variability of each variable in each flow is quantified by semi-variograms. Each flow is simulated to reproduce the characteristics, or behaviour, of the phenomenon as observed in the available data. The expected value of each variable in each flow is calculated by averaging of the simulated values. The problem expressed in terms of CCP is transformed into an appropriate deterministic equivalent, which is a non-linear optimization problem. The new form of the problem is solved by multi-objective simulated annealing. A case study is carried out to demonstrate the technique. The problem is formulated in terms of iron, silica and alumina grades with four ore sources. Pros and cons of the technique are discussed.