Zobrazit minimální záznam

dc.contributor.authorBriš, Radim
dc.date.accessioned2008-05-13T11:22:55Z
dc.date.available2008-05-13T11:22:55Z
dc.date.issued2008
dc.identifier.citationReliability Engineering & System Safety. 2008, vol. 93, issue 6, p. 874-884.en
dc.identifier.issn0951-8320
dc.identifier.urihttp://hdl.handle.net/10084/65056
dc.description.abstractAn efficient simulation algorithm for the quantification of reliability performance indicators of a complex system is demonstrated in the paper that is based on Monte Carlo method. A directed Acyclic Graph is used as a useful system representation. A parallel simulation technique is used in the algorithm which is based on the construction of the special course of life sequence of transformed transition times subjected to the corresponding part of the Acyclic Graph. The parts of the Acyclic Graph represent individual subsystems of a given system and may be effectively evaluated from the reliability point of view. The wide range of models for both deterministic and stochastic processes applied on the terminal nodes of the Acyclic Graph is allowed in the algorithm. The use of the algorithm for comparative theoretical calculations as well as for industrial applications is shown by a visual demonstration. A cost-optimization problem is shortly introduced which may be fully solved by the algorithm using additional genetic algorithms as an applicable optimization technique. The problem takes into account also additional objective that is defined as a prescribed constraint of a selected reliability performance indicator. The solution of the cost-optimization problem is demonstrated on two practical examples.en
dc.language.isoenen
dc.publisherElsevieren
dc.relation.ispartofseriesReliability Engineering & System Safetyen
dc.relation.urihttp://dx.doi.org/10.1016/j.ress.2007.03.036en
dc.subjectMonte Carloen
dc.subjectreliability indicatorsen
dc.subjectAcyclic Graphen
dc.subjectcost-optimization problemen
dc.titleParallel simulation algorithm for maintenance optimization based on directed Acyclic Graphen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.identifier.doi10.1016/j.ress.2007.03.036
dc.identifier.wos000255103300010


Soubory tohoto záznamu

SouboryVelikostFormátZobrazit

K tomuto záznamu nejsou připojeny žádné soubory.

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam