1. //
  2. Start
  3. //
  4. Publikationen
  5. Heuristic approximation and computationa...
  6. Formate
  7. //

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

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

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 Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

Harvard

Daduna, H, Krenzler, R, Ritter, R & Stoyan, D 2018, 'Heuristic approximation and computational algorithms for closed networks: A case study in open-pit mining', Performance Evaluation, Jg. 119, S. 5-26. https://doi.org/10.1016/j.peva.2017.12.002

APA

Daduna, H., Krenzler, R., Ritter, R., & Stoyan, D. (2018). Heuristic approximation and computational algorithms for closed networks: A case study in open-pit mining. Performance Evaluation, 119, 5-26. https://doi.org/10.1016/j.peva.2017.12.002

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 -

Weitere Publikationen dieser Person(en)

Insights into the accuracy of social scientists’ forecasts of societal change

Grossmann, I., Rotella, A., Hutcherson, C. A., Sharpinskyi, K., Varnum, M. E. W., Achter, S., Dhami, M. K., Guo, X. E., Kara-Yakoubian, M., Mandel, D. R., Raes, L., Tay, L., Vie, A., Wagner, L., Adamkovic, M., Arami, A., Arriaga, P., Bandara, K., Baník, G., Bartoš, F., Baskin, E., Bergmeir, C., Białek, M., Børsting, C. K., Browne, D. T., Caruso, E. M., Chen, R., Chie, B. T., Chopik, W. J., Collins, R. N., Cong, C. W., Conway, L. G., Davis, M., Day, M. V., Dhaliwal, N. A., Durham, J. D., Dziekan, M., Elbaek, C. T., Shuman, E., Fabrykant, M., Firat, M., Fong, G. T., Frimer, J. A., Gallegos, J. M., Goldberg, S. B., Gollwitzer, A., Goyal, J., Graf-Vlachy, L., Krenzler, R. & Sevincer, T., 04.2023, in: Nature Human Behaviour. 7, 4, S. 484-501 18 S.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems

Otten, S., Krenzler, R., Xie, L., Daduna, H. & Kruse, K., 06.2022, in: OR Spectrum. 44, 2, S. 603-648 46 S.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

Introducing split orders and optimizing operational policies in robotic mobile fulfillment systems

Xie, L., Thieme, N., Krenzler, R. & Li, H., 01.01.2021, in: European Journal of Operational Research . 288, 1, S. 80-97 18 S.

Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet

Performance analysis for loss systems with many subscribers and concurrent services

Daduna, H. & Krenzler, R., 2020, Measurement, Modelling and Evaluation of Computing Systems : 20th International GI/ITG Conference, MMB 2020, Saarbrücken, Germany, March 16–18, 2020, Proceedings. Hermanns, H. (Hrsg.). Cham: Springer Verlag, S. 118-135 18 S. (Lecture Notes in Computer Science ; Band 12040 LNCS)(Programming and Software Engineering; Band 12040).

Publikation: Beiträge in Sammelwerken › Aufsätze in Konferenzbänden › Forschung › begutachtet

Efficient Order Picking Methods in Robotic Mobile Fulfillment Systems

Xie, L., Thieme, N., Krenzler, R. & Li, H., 2019, 31 S.

Publikation: Arbeits- oder Diskussionspapiere und Berichte › Arbeits- oder Diskussionspapiere

DOI

Zuletzt angesehen

Aktivitäten

  1. Taking ICALL to task: Blending form-focus & task-based foreign language learning
  2. Masked Autoencoder Pretraining for Event Classification in Elite Soccer
  3. Institutional Proxy Representatives of Future Generations: A Comparative Analysis of Types and Design Features
  4. Domestication and/or Digital Divide – How to Overcome Binary Classifications in Analysing Everyday Internet Use and Diffusion
  5. SIAM Conference on Applications of Dynamical Systems - DS 2023
  6. How, when, and why do negotiators use reference points? A qualitative interview study with negotiation experts.
  7. A Dynamic Signal Analyzer. Analysis and Synthesis of Speech at the Biological Computer Laboratory
  8. Reconsidering performativity in alternativity: Forward an otative management science
  9. Global Platform Companies in Local Fields between Disruption and Integration
  10. Connecting Patterns: Sustainability and the Culture of Complexity

Publikationen

  1. Preventive Emergency Detection Based on the Probabilistic Evaluation of Distributed, Embedded Sensor Networks
  2. A transfer operator based computational study of mixing processes in open flow systems
  3. Automatic enumeration of all connected subgraphs.
  4. Methodologies for Noise and Gross Error Detection using Univariate Signal-Based Approaches in Industrial Application
  5. Enabling Road Condition Monitoring with an on-board Vehicle Sensor Setup
  6. Efficient and accurate ℓ p-norm multiple kernel learning
  7. Neural network-based adaptive fault-tolerant control for strict-feedback nonlinear systems with input dead zone and saturation
  8. Different complex word problems require different combinations of cognitive skills
  9. Semantic Parsing for Knowledge Graph Question Answering with Large Language Models
  10. Control of the inverse pendulum based on sliding mode and model predictive control
  11. Clustering Hydrological Homogeneous Regions and Neural Network Based Index Flood Estimation for Ungauged Catchments
  12. Latent structure perceptron with feature induction for unrestricted coreference resolution
  13. Selecting and Adapting Methods for Analysis and Design in Value-Sensitive Digital Social Innovation Projects: Toward Design Principles
  14. Modeling Effective and Ineffective Knowledge Communication and Learning Discourses in CSCL with Hidden Markov Models
  15. Problem structuring for transitions
  16. Using Decision Trees and Reinforcement Learning for the Dynamic Adjustment of Composite Sequencing Rules in a Flexible Manufacturing System
  17. Spatial mislocalization as a consequence of sequential coding of stimuli
  18. DialogueMaps: Supporting interactive transdisciplinary dialogues with a web-based tool for multi-layer knowledge maps
  19. Real-time RDF extraction from unstructured data streams
  20. A Multivariate Method for Dynamic System Analysis
  21. On the Decoupling and Output Functional Controllability of Robotic Manipulation
  22. Analysis of long-term statistical data of cobalt flows in the EU
  23. Supporting the Development and Implementation of a Digitalization Strategy in SMEs through a Lightweight Architecture-based Method
  24. FFTSMC with Optimal Reference Trajectory Generated by MPC in Robust Robotino Motion Planning with Saturating Inputs
  25. Retest effects in matrix test performance