IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v33y2018i3d10.1007_s00180-016-0669-z.html
   My bibliography  Save this article

Model based optimization of a statistical simulation model for single diamond grinding

Author

Listed:
  • Swetlana Herbrandt

    (TU Dortmund)

  • Uwe Ligges

    (TU Dortmund)

  • Manuel Pinho Ferreira

    (TU Dortmund)

  • Michael Kansteiner

    (TU Dortmund)

  • Dirk Biermann

    (TU Dortmund)

  • Wolfgang Tillmann

    (TU Dortmund)

  • Claus Weihs

    (TU Dortmund)

Abstract

We present a model for simulating normal forces arising during a grinding process in cement for single diamond grinding. Assuming the diamond to have the shape of a pyramid, a very fast calculation of force and removed volume can be achieved. The basic approach is the simulation of the scratch track. Its triangle profile is determined by the shape of the diamond. The approximation of the scratch track is realized by stringing together polyhedra. Their sizes depend on both the actual cutting depth and an error implicitly describing the material brittleness. Each scratch track part can be subdivided into three three-dimensional simplices for a straightforward calculation of the removed volume. Since the scratched mineral subsoil is generally inhomogeneous, the forces at different positions of the workpiece are expected to vary. This heterogeneous nature is considered by sampling from a Gaussian random field. To achieve a realistic outcome the model parameters are adjusted applying model based optimization methods. A noisy Kriging model is chosen as surrogate to approximate the deviation between modelled and observed forces. This deviation is minimized and the results of the modelled forces and the actual forces from conducted experiments are rather similar.

Suggested Citation

  • Swetlana Herbrandt & Uwe Ligges & Manuel Pinho Ferreira & Michael Kansteiner & Dirk Biermann & Wolfgang Tillmann & Claus Weihs, 2018. "Model based optimization of a statistical simulation model for single diamond grinding," Computational Statistics, Springer, vol. 33(3), pages 1127-1143, September.
    • Handle: RePEc:spr:compst:v:33:y:2018:i:3:d:10.1007_s00180-016-0669-z
    DOI: 10.1007/s00180-016-0669-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-016-0669-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00180-016-0669-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. D. Huang & T. Allen & W. Notz & N. Zeng, 2006. "Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models," Journal of Global Optimization, Springer, vol. 34(3), pages 441-466, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hans A. Kestler & Bernd Bischl & Matthias Schmid, 2018. "Proceedings of Reisensburg 2014–2015," Computational Statistics, Springer, vol. 33(3), pages 1125-1126, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ehsan Mehdad & Jack P. C. Kleijnen, 2018. "Efficient global optimisation for black-box simulation via sequential intrinsic Kriging," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(11), pages 1725-1737, November.
    2. Zheng, Liang & Xue, Xinfeng & Xu, Chengcheng & Ran, Bin, 2019. "A stochastic simulation-based optimization method for equitable and efficient network-wide signal timing under uncertainties," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 287-308.
    3. Songhao Wang & Szu Hui Ng & William Benjamin Haskell, 2022. "A Multilevel Simulation Optimization Approach for Quantile Functions," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 569-585, January.
    4. Diariétou Sambakhé & Lauriane Rouan & Jean-Noël Bacro & Eric Gozé, 2019. "Conditional optimization of a noisy function using a kriging metamodel," Journal of Global Optimization, Springer, vol. 73(3), pages 615-636, March.
    5. Qi Fan & Jiaqiao Hu, 2018. "Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 677-693, November.
    6. Donghun Lee, 2022. "Knowledge Gradient: Capturing Value of Information in Iterative Decisions under Uncertainty," Mathematics, MDPI, vol. 10(23), pages 1-20, November.
    7. Dellino, G. & Lino, P. & Meloni, C. & Rizzo, A., 2009. "Kriging metamodel management in the design optimization of a CNG injection system," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 79(8), pages 2345-2360.
    8. Mehdad, E. & Kleijnen, Jack P.C., 2014. "Global Optimization for Black-box Simulation via Sequential Intrinsic Kriging," Other publications TiSEM 8fa8d96f-a086-4c4b-88ab-9, Tilburg University, School of Economics and Management.
    9. Zhe Zhou & Fusheng Bai, 2018. "An adaptive framework for costly black-box global optimization based on radial basis function interpolation," Journal of Global Optimization, Springer, vol. 70(4), pages 757-781, April.
    10. Dawei Zhan & Jiachang Qian & Yuansheng Cheng, 2017. "Balancing global and local search in parallel efficient global optimization algorithms," Journal of Global Optimization, Springer, vol. 67(4), pages 873-892, April.
    11. Kleijnen, Jack P.C., 2009. "Kriging metamodeling in simulation: A review," European Journal of Operational Research, Elsevier, vol. 192(3), pages 707-716, February.
    12. Peter Frazier & Warren Powell & Savas Dayanik, 2009. "The Knowledge-Gradient Policy for Correlated Normal Beliefs," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 599-613, November.
    13. Taimoor Akhtar & Christine Shoemaker, 2016. "Multi objective optimization of computationally expensive multi-modal functions with RBF surrogates and multi-rule selection," Journal of Global Optimization, Springer, vol. 64(1), pages 17-32, January.
    14. Emre Barut & Warren Powell, 2014. "Optimal learning for sequential sampling with non-parametric beliefs," Journal of Global Optimization, Springer, vol. 58(3), pages 517-543, March.
    15. Zilong Wang & Marianthi Ierapetritou, 2018. "Surrogate-based feasibility analysis for black-box stochastic simulations with heteroscedastic noise," Journal of Global Optimization, Springer, vol. 71(4), pages 957-985, August.
    16. Satyajith Amaran & Nikolaos V. Sahinidis & Bikram Sharda & Scott J. Bury, 2016. "Simulation optimization: a review of algorithms and applications," Annals of Operations Research, Springer, vol. 240(1), pages 351-380, May.
    17. Raymond K. W. Wong & Curtis B. Storlie & Thomas C. M. Lee, 2017. "A frequentist approach to computer model calibration," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(2), pages 635-648, March.
    18. Gyoung-Ja Lee & Won-Ju Hwang & Jin-Ju Park & Min-Ku Lee, 2019. "Study of Sensitive Parameters on the Sensor Performance of a Compression-Type Piezoelectric Accelerometer Based on the Meta-Model," Energies, MDPI, vol. 12(7), pages 1-11, April.
    19. Enlu Zhou & Shalabh Bhatnagar, 2018. "Gradient-Based Adaptive Stochastic Search for Simulation Optimization Over Continuous Space," INFORMS Journal on Computing, INFORMS, vol. 30(1), pages 154-167, February.
    20. Diana M. Negoescu & Peter I. Frazier & Warren B. Powell, 2011. "The Knowledge-Gradient Algorithm for Sequencing Experiments in Drug Discovery," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 346-363, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:compst:v:33:y:2018:i:3:d:10.1007_s00180-016-0669-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.