Robust estimation of dependent competing risk model under interval monitoring and determining optimal inspection intervals
Recently, a growing interest is evident in modelling dependent competing risks in lifetime prognosis problems. In this work, we propose to model the dependent competing risks by Marshal‐Olkin bivariate exponential distribution. The observable data consists of a number of failures due to different ca...
Saved in:
Published in | Applied stochastic models in business and industry Vol. 40; no. 4; pp. 926 - 944 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Bognor Regis
Wiley Subscription Services, Inc
01.07.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Recently, a growing interest is evident in modelling dependent competing risks in lifetime prognosis problems. In this work, we propose to model the dependent competing risks by Marshal‐Olkin bivariate exponential distribution. The observable data consists of a number of failures due to different causes across different time intervals. The failure count data is common in instances like one‐shot devices where the state of the subjects is inspected at different inspection times rather than the exact failure times. The point estimation of the lifetime distribution in the presence of competing risk has been studied through a divergence‐based robust estimation method called minimum density power divergence estimation (MDPDE) with and without constraint. The optimal value of the tuning parameter has been obtained. The testing of the hypothesis is performed based on a Wald‐type test statistic. The influence function is derived for the point estimator and the test statistic, reflecting the degree of robustness. Another key contribution of this work is determining the optimal inspection times based on predefined objectives. This article presents the determination of multi‐criteria‐based optimal design. Population‐based heuristic algorithm nondominated sorting‐based multiobjective Genetic algorithm is exploited to solve this optimization problem. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 1524-1904 1526-4025 |
DOI: | 10.1002/asmb.2854 |