SwePub
Sök i LIBRIS databas

  Utökad sökning

WFRF:(Friis Jesper)
 

Sökning: WFRF:(Friis Jesper) > (2020-2023) > A numerical study o...

  • Fink Andersen, JesperTechnical University of Denmark, Department of Applied Mathematics and Computer Science, Anker Engelunds Vej 1, 2800 Kgs. Lyngby, Denmark (författare)

A numerical study of Markov decision process algorithms for multi-component replacement problems

  • Artikel/kapitelEngelska2022

Förlag, utgivningsår, omfång ...

  • Elsevier,2022
  • printrdacarrier

Nummerbeteckningar

  • LIBRIS-ID:oai:DiVA.org:ltu-86333
  • https://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-86333URI
  • https://doi.org/10.1016/j.ejor.2021.07.007DOI

Kompletterande språkuppgifter

  • Språk:engelska
  • Sammanfattning på:engelska

Ingår i deldatabas

Klassifikation

  • Ämneskategori:ref swepub-contenttype
  • Ämneskategori:art swepub-publicationtype

Anmärkningar

  • Validerad;2022;Nivå 2;2022-03-02 (hanlid)
  • We present a unified modeling framework for Time-Based Maintenance (TBM) and Condition-Based Maintenance (CBM) for optimization of replacements in multi-component systems. The considered system has a K-out-of-N reliability structure, and components deteriorate according to a multivariate gamma process with Lévy copula dependence. The TBM and CBM models are formulated as Markov Decision Processes (MDPs), and optimal policies are found using dynamic programming. Solving the CBM model requires that the continuous deterioration process is discretized. We therefore investigate the discretization level required for obtaining a near-optimal policy. Our results indicate that a coarser discretization level than previously suggested in the literature is adequate, indicating that dynamic programming is a feasible approach for optimization in multi-component systems. We further demonstrate this through empirical results for the size limit of the MDP models when solved with an optimized implementation of modified policy iteration. The TBM model can generally be solved with more components than the CBM model, since the former has a sparser state transition structure. In the special case of independent component deterioration, transition probabilities can be calculated efficiently at runtime. This reduces the memory requirements substantially. For this case, we also achieved a tenfold speedup when using ten processors in a parallel implementation of algorithm. Altogether, our results show that the computational requirements for systems with independent component deterioration increase at a slower rate than for systems with stochastic dependence.

Ämnesord och genrebeteckningar

Biuppslag (personer, institutioner, konferenser, titlar ...)

  • Andersen, Anders ReenbergTechnical University of Denmark, Department of Applied Mathematics and Computer Science, Anker Engelunds Vej 1, 2800 Kgs. Lyngby, Denmark (författare)
  • Kulahci, MuratLuleå tekniska universitet,Industriell ekonomi,Technical University of Denmark, Department of Applied Mathematics and Computer Science, Anker Engelunds Vej 1, 2800 Kgs. Lyngby, Denmark(Swepub:ltu)murkul (författare)
  • Nielsen, Bo FriisTechnical University of Denmark, Department of Applied Mathematics and Computer Science, Anker Engelunds Vej 1, 2800 Kgs. Lyngby, Denmark (författare)
  • Technical University of Denmark, Department of Applied Mathematics and Computer Science, Anker Engelunds Vej 1, 2800 Kgs. Lyngby, DenmarkIndustriell ekonomi (creator_code:org_t)

Sammanhörande titlar

  • Ingår i:European Journal of Operational Research: Elsevier299:3, s. 898-9090377-22171872-6860

Internetlänk

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy