Heuristic approximation and computational algorithms for closed networks: A case study in open-pit mining

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

Standard

Heuristic approximation and computational algorithms for closed networks: A case study in open-pit mining. / Daduna, Hans; Krenzler, Ruslan; Ritter, Robert et al.
in: Performance Evaluation, Jahrgang 119, 03.2018, S. 5-26.

Publikation: Beiträge in ZeitschriftenZeitschriftenaufsätzeForschungbegutachtet

Harvard

APA

Vancouver

Daduna H, Krenzler R, Ritter R, Stoyan D. Heuristic approximation and computational algorithms for closed networks: A case study in open-pit mining. Performance Evaluation. 2018 Mär;119:5-26. Epub 2017 Dez 19. doi: 10.1016/j.peva.2017.12.002

Bibtex

@article{5648747307504ae49e4d9e2fabfb27cb,
title = "Heuristic approximation and computational algorithms for closed networks: A case study in open-pit mining",
abstract = "We investigate a fundamental model from open-pit mining which is a cyclic system consisting of an (unreliable) shovel, trucks travelling loaded, unloading facility, and trucks travelling back empty. The interaction of these subsystems determines the mean number of trucks loaded per time unit — the capacity of the shovel, which is a fundamental quantity of interest. To determine this capacity we need the stationary probability that the shovel is idle. Because an exact analysis of the performance of the system is out of reach, besides of simulations there are various approximation algorithms proposed in the literature, which stem from computer science and can be characterized as general purpose algorithms. We propose for solving the special problem under mining conditions an extremely simple alternative algorithm. Comparison with several general purpose algorithms shows that for realistic situations in the open-pit mining application the special algorithm outperforms the precision of general purpose algorithms. This holds even if the general purpose algorithms incorporate more details of the underlying models than our simple algorithm, which is based on a strongly reduced model. The comparison and assessment is done with extensive simulations on a level of detail which the general purpose algorithms are able to cover. We discuss the application of our proposed algorithms to other applications. It turns out that our algorithms are analogues to Norton's Theorem for a large class of general transportation systems.",
keywords = "Mathematics, Queues, Algorithms, Heuristic methods, Mining, Queues, Algorithms, Heuristic methods, Long-run idle times, Transport, Engineering, Mining, Transport, Long-run idle times",
author = "Hans Daduna and Ruslan Krenzler and Robert Ritter and Dietrich Stoyan",
year = "2018",
month = mar,
doi = "10.1016/j.peva.2017.12.002",
language = "English",
volume = "119",
pages = "5--26",
journal = "Performance Evaluation",
issn = "0166-5316",
publisher = "Elsevier B.V.",

}

RIS

TY - JOUR

T1 - Heuristic approximation and computational algorithms for closed networks

T2 - A case study in open-pit mining

AU - Daduna, Hans

AU - Krenzler, Ruslan

AU - Ritter, Robert

AU - Stoyan, Dietrich

PY - 2018/3

Y1 - 2018/3

N2 - We investigate a fundamental model from open-pit mining which is a cyclic system consisting of an (unreliable) shovel, trucks travelling loaded, unloading facility, and trucks travelling back empty. The interaction of these subsystems determines the mean number of trucks loaded per time unit — the capacity of the shovel, which is a fundamental quantity of interest. To determine this capacity we need the stationary probability that the shovel is idle. Because an exact analysis of the performance of the system is out of reach, besides of simulations there are various approximation algorithms proposed in the literature, which stem from computer science and can be characterized as general purpose algorithms. We propose for solving the special problem under mining conditions an extremely simple alternative algorithm. Comparison with several general purpose algorithms shows that for realistic situations in the open-pit mining application the special algorithm outperforms the precision of general purpose algorithms. This holds even if the general purpose algorithms incorporate more details of the underlying models than our simple algorithm, which is based on a strongly reduced model. The comparison and assessment is done with extensive simulations on a level of detail which the general purpose algorithms are able to cover. We discuss the application of our proposed algorithms to other applications. It turns out that our algorithms are analogues to Norton's Theorem for a large class of general transportation systems.

AB - We investigate a fundamental model from open-pit mining which is a cyclic system consisting of an (unreliable) shovel, trucks travelling loaded, unloading facility, and trucks travelling back empty. The interaction of these subsystems determines the mean number of trucks loaded per time unit — the capacity of the shovel, which is a fundamental quantity of interest. To determine this capacity we need the stationary probability that the shovel is idle. Because an exact analysis of the performance of the system is out of reach, besides of simulations there are various approximation algorithms proposed in the literature, which stem from computer science and can be characterized as general purpose algorithms. We propose for solving the special problem under mining conditions an extremely simple alternative algorithm. Comparison with several general purpose algorithms shows that for realistic situations in the open-pit mining application the special algorithm outperforms the precision of general purpose algorithms. This holds even if the general purpose algorithms incorporate more details of the underlying models than our simple algorithm, which is based on a strongly reduced model. The comparison and assessment is done with extensive simulations on a level of detail which the general purpose algorithms are able to cover. We discuss the application of our proposed algorithms to other applications. It turns out that our algorithms are analogues to Norton's Theorem for a large class of general transportation systems.

KW - Mathematics

KW - Queues

KW - Algorithms

KW - Heuristic methods

KW - Mining

KW - Queues

KW - Algorithms

KW - Heuristic methods

KW - Long-run idle times

KW - Transport

KW - Engineering

KW - Mining

KW - Transport

KW - Long-run idle times

UR - http://www.scopus.com/inward/record.url?scp=85039908485&partnerID=8YFLogxK

U2 - 10.1016/j.peva.2017.12.002

DO - 10.1016/j.peva.2017.12.002

M3 - Journal articles

VL - 119

SP - 5

EP - 26

JO - Performance Evaluation

JF - Performance Evaluation

SN - 0166-5316

ER -

DOI

Zuletzt angesehen

Publikationen

  1. Model inversion using fuzzy neural network with boosting of the solution
  2. Inversion of Fuzzy Neural Networks for the Reduction of Noise in the Control Loop for Automotive Applications
  3. Modelling the Complexity of Measurement Estimation Situations - A Theoretical Framework for the Estimation of Lengths
  4. Towards improved dispatching rules for complex shop floor scenarios - A genetic programming approach
  5. Ambient Intelligence and Knowledge Processing in Distributed Autonomous AAL-Components
  6. FFTSMC with Optimal Reference Trajectory Generated by MPC in Robust Robotino Motion Planning with Saturating Inputs
  7. Using Complexity Metrics to Assess Silent Reading Fluency
  8. Algebraic combinatorics in mathematical chemistry. Methods and algorithms. I. Permutation groups and coherent (cellular) algebras.
  9. Fast, Fully Automated Analysis of Voriconazole from Serum by LC-LC-ESI-MS-MS with Parallel Column-Switching Technique
  10. Switching from a Managing to a Monitoring Function on the Board
  11. Analysis and Implementation of a Resistance Temperature Estimator Based on Bi-Polynomial Least Squares Method and Discrete Kalman Filter
  12. The Use of Factorization and Multimode Parametric Spectra in Estimating Frequency and Spectral Parameters of Signal
  13. Passive Peak Voltage Sensor for Multiple Sending Coils Inductive Power Transmission System
  14. Set oriented approximation of invariant manifolds
  15. Integrating the underlying structure of stochasticity into community ecology
  16. A Class of Simple Stochastic Online Bin Packing Algorithms
  17. Early Detection of Faillure in Conveyor Chain Systems by Wireless Sensor Node
  18. A reference architecture for the integration of EMIS and ERP-Systems
  19. From Knowledge to Application
  20. Metaphors and Paradigms of the Language Animal—or—The Advantage of seeing “Time Is a Resource” as a Paradigm
  21. Evaluation of standard ERP software implementation approaches in terms of their capability for business process optimization
  22. Modelling and implementation of an Order2Cash Process in distributed systems
  23. Measuring Learning Styles with Questionnaires Versus Direct Observation of Preferential Choice Behavior in Authentic Learning Situations
  24. Optimizing price levels in e-commerce applications with respect to customer lifetime values
  25. Dividing Apples and Pears: Towards a Taxonomy for Agile Transformation
  26. Developing a Complex Portrait of Content Teaching for Multilingual Learners via Nonlinear Theoretical Understandings
  27. Sharing in Christ's rule
  28. Assessment of cognitive load in multimedia learning using dual-task methodology
  29. Detection of coherent oceanic structures via transfer operators
  30. Mathematical relation between extended connectivity and eigenvector coefficients.