Zhuo Hu , Chao Dang , Da Wang , Michael Beer , Lei Wang
{"title":"Error-informed parallel adaptive Kriging method for time-dependent reliability analysis","authors":"Zhuo Hu , Chao Dang , Da Wang , Michael Beer , Lei Wang","doi":"10.1016/j.ress.2025.111194","DOIUrl":"10.1016/j.ress.2025.111194","url":null,"abstract":"<div><div>Active learning single-loop Kriging methods have gained significant attention for time-dependent reliability analysis. However, it still remains a challenge to estimate the time-dependent failure probability efficiently and accurately in practical engineering problems. This study proposes a new method, called ‘Error-informed Parallel Adaptive Kriging’ (EPAK) for efficient time-dependent reliability analysis. First, a sequential variance-amplified importance sampling technique is developed to estimate the time-dependent failure probability based on the trained global response Kriging model of the true performance function. Then, the maximum relative error of the time-dependent failure probability is derived to facilitate the construction of stopping criterion. Finally, a parallel sampling strategy is proposed through combining the relative error contribution and an influence function, which enables parallel computing and reduces the unnecessary limit state function evaluations caused by excessive clustering. The superior performance of the proposed method is validated through several examples. Numerical results demonstrate that the method can accurately estimate the time-dependent failure probability with higher efficiency than several compared methods.</div></div>","PeriodicalId":54500,"journal":{"name":"Reliability Engineering & System Safety","volume":"262 ","pages":"Article 111194"},"PeriodicalIF":9.4,"publicationDate":"2025-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143943673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ke Zhou , Xiang Zhong , Haidong Shao , Haomiao Zhang , Bin Liu
{"title":"DT-PPO: A Real-Time multisensor-driven predictive maintenance framework","authors":"Ke Zhou , Xiang Zhong , Haidong Shao , Haomiao Zhang , Bin Liu","doi":"10.1016/j.ress.2025.111227","DOIUrl":"10.1016/j.ress.2025.111227","url":null,"abstract":"<div><div>Prognostics and health management (PHM) encompasses both predictive maintenance and health monitoring efforts. However, most studies either focus on prognostics or decision-making in isolation, with only a few attempts to integrate residual life prediction with maintenance strategies. Yet the resulting solutions are often cumbersome and impractical for real-world application. To address this gap, this paper proposes a dynamic transition-proximal policy optimization (DT-PPO) network for predictive maintenance of mechanical equipment. The framework processes multisensory data containing degradation information at different scales, and accurately transforms the initial equipment states into belief states, enabling real-time maintenance decisions. First, a state transition network (TransStateNet) is built as a deep self-encoder to selectively extract multisensory features at different scales and output belief states. Second, a DT-PPO architecture based on belief states is designed to develop maintenance strategies, including spare parts ordering and downtime planning. Finally, an s-g policy is incorporated into the DT-PPO to guide action selection, while state sliding windows process multi-sensor sequence data to reduce uncertainty in the action space, enhancing the robustness of the maintenance strategy. Experimental comparisons against benchmark strategies validate the superiority of the proposed framework.</div></div>","PeriodicalId":54500,"journal":{"name":"Reliability Engineering & System Safety","volume":"262 ","pages":"Article 111227"},"PeriodicalIF":9.4,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143943672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zongzhen Ye , Jun Wu , Xuesong He , Tianjiao Dai , Haiping Zhu
{"title":"Source-free domain adaptation framework for rotating machinery fault diagnosis by reliable self-learning and auxiliary contrastive learning","authors":"Zongzhen Ye , Jun Wu , Xuesong He , Tianjiao Dai , Haiping Zhu","doi":"10.1016/j.ress.2025.111228","DOIUrl":"10.1016/j.ress.2025.111228","url":null,"abstract":"<div><div>Domain adaptation techniques have been extensively studied and applied in rotating machinery fault diagnosis to improve diagnostic performance. However, most existing approaches require direct access to source domain samples, which are often unavailable in industrial applications due to the limitations of privacy protection, storage space, and transmission bandwidth. To address these challenges, this paper proposes a novel source-free domain adaptation framework for rotating machinery fault diagnosis, which can disentangle the domain adaptation from the need of source domain samples. First, a nearest neighbor knowledge aggregation strategy is designed to generate more reliable pseudo-labels. Then, the classification loss is re-weighted according to the reliability of pseudo-labels that are quantified through uncertainty estimation. Second, an auxiliary contrastive learning framework is applied in the target feature space to facilitate knowledge aggregation. In particular, a new negative pair exclusion scheme is introduced to recognize and exclude negative pairs composed of same-category samples, even in the existence of some noisy pseudo-labels. The cross-condition and cross-device experiments on three datasets are implemented to verify the feasibility and superiority of the proposed method.</div></div>","PeriodicalId":54500,"journal":{"name":"Reliability Engineering & System Safety","volume":"262 ","pages":"Article 111228"},"PeriodicalIF":9.4,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144106936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Reliability modeling for linear and circular of Weighted-Consecutive-k Systems with shared components","authors":"Qinglai Dong , Le Hou , Hongda Gao","doi":"10.1016/j.ress.2025.111187","DOIUrl":"10.1016/j.ress.2025.111187","url":null,"abstract":"<div><div>In most modern systems, the importance of all system components is different from each other, and we refer to this importance as weights. In weighted-consecutive-<span><math><mi>k</mi></math></span> system, each component has its own positive integer weight. The system will fail only when the total weight of successive failed components reaches <span><math><mi>k</mi></math></span>. We extend the weighted-consecutive-<span><math><mi>k</mi></math></span> system model by proposing weighted-consecutive-<span><math><mi>k</mi></math></span> systems having shared components between neighboring subsystems. We have demonstrated the formulas for determining the reliability of weighted-consecutive-<span><math><mi>k</mi></math></span> systems with various cases based on the state of the first and/or last component(s) using recursion. On this basis, the steps of reliability calculation for linear and circular structures sharing one component and linear structures sharing multiple components are given. Finally, give some examples and the influence of different choices of shared components and independent components and <span><math><mi>k</mi></math></span> on system reliability is studied.</div></div>","PeriodicalId":54500,"journal":{"name":"Reliability Engineering & System Safety","volume":"262 ","pages":"Article 111187"},"PeriodicalIF":9.4,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143935834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An optimal self-healing policy with discrete resources","authors":"Rui Zheng , Jingyuan Shen","doi":"10.1016/j.ress.2025.111186","DOIUrl":"10.1016/j.ress.2025.111186","url":null,"abstract":"<div><div>Intelligent systems capable of detecting and repairing damage autonomously hold significant promise across various domains, such as space exploration, autonomous vehicles, and robotics. Integrating self-healing mechanisms is pivotal in enhancing these systems’ durability, reliability, and efficiency. This paper introduces a novel self-healing policy with discrete self-healing resources. Self-inspections at equidistant time epochs reveal the deterioration of the system. Various actions, including doing nothing, self-healing, and stopping, can be selected after inspection. A self-healing action reduces deterioration to a random lower level, with the degree of reduction depending on the amount of healing resources used. Therefore, it is crucial to determine the optimal number of healing resources to allocate during self-healing. The goal is to identify the policy that minimizes the expected average cost. This optimization problem is formulated within the semi-Markov decision process framework. The structural properties of the optimal policy are examined. A policy iteration algorithm is developed based on a discretization approach. A numerical example is used to show how to apply the proposed approach, and the obtained policy provides valuable insights to support the operation of intelligent systems.</div></div>","PeriodicalId":54500,"journal":{"name":"Reliability Engineering & System Safety","volume":"262 ","pages":"Article 111186"},"PeriodicalIF":9.4,"publicationDate":"2025-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143935833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A novel d-flow network decomposition algorithm for fast search and efficient storage of all d-MPs","authors":"Baichao Wu","doi":"10.1016/j.ress.2025.111220","DOIUrl":"10.1016/j.ress.2025.111220","url":null,"abstract":"<div><div>The <em>d</em>-MPs algorithm is one of the main algorithms for calculating the reliability of multi-state flow networks (MFNs). However, two issues remain unresolved in existing algorithms searching for <em>d-</em>MPs: redundant calculations during network decomposition and efficient storage of all <em>d</em>-MPs. A novel <em>d</em>-flow network decomposition algorithm is proposed to resolve the abovementioned issues. During the process of network decomposition with the demand <em>d</em>, the storage and identification of isomorphic subgraphs are utilized to avoid redundant decomposition of the subgraphs. Additionally, all <em>d-</em>MPs are stored in a directed graph, and finally, the depth-first search (DFS) algorithm is employed to search for all <em>d-</em>MPs. Furthermore, the proposed algorithm's time and space complexity is analyzed. Experimental results on the selected networks with different scenarios show that the efficiency of the proposed algorithm is significantly higher than the previous efficient methods in most cases. In Example 2, when <em>d</em> = 13, the proposed algorithm outperforms the previous fastest algorithm by 3.4 times. Additionally, Example 3 demonstrates that over 5.4 × 10⁶ valid <em>d</em>-MPs can be stored in a directed graph with only 819 vertices and 1572 edges, indicating the proposed method substantially reduces memory usage.<ul><li><span>1.</span><span><div>The network is connected and free of self-loops;</div></span></li><li><span>2.</span><span><div>The capacity of each edge is a non-negative integer following a given probability distribution;</div></span></li><li><span>3.</span><span><div>The capacities of different edges are statistically independent.</div></span></li><li><span>4.</span><span><div>The vertex is perfectly reliable.</div></span></li><li><span>5.</span><span><div>The flow conservation law is obeyed.</div></span></li></ul></div></div>","PeriodicalId":54500,"journal":{"name":"Reliability Engineering & System Safety","volume":"262 ","pages":"Article 111220"},"PeriodicalIF":9.4,"publicationDate":"2025-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143949005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Isis Didier Lins , Lavínia Maria Mendes Araújo , Caio Bezerra Souto Maior , Erico Souza Teixeira , Pâmela Thays Lins Bezerra , Márcio José das Chagas Moura , Enrique López Droguett
{"title":"Quantum-based optimization methods for the linear redundancy allocation problem: A comparative analysis","authors":"Isis Didier Lins , Lavínia Maria Mendes Araújo , Caio Bezerra Souto Maior , Erico Souza Teixeira , Pâmela Thays Lins Bezerra , Márcio José das Chagas Moura , Enrique López Droguett","doi":"10.1016/j.ress.2025.111153","DOIUrl":"10.1016/j.ress.2025.111153","url":null,"abstract":"<div><div>The redundancy allocation problem (RAP) aims to efficiently assign multiple parallel components to maximize overall system reliability while adhering to budget constraints. This non-linear and NP-hard combinatorial optimization (CO) problem has been tackled through the development and application of exact methods and meta-heuristics. Moreover, recent advancements in quantum computing have opened up new avenues for addressing CO problems, often formulated as quadratic unconstrained binary optimization (QUBO) models. Our paper contributes by modeling RAP as a binary linear problem, translating it into a QUBO model, and solving it using exhaustive, exact, and quantum optimization approaches. To date, this is the first application of quantum methods to RAP. Initially, among the quantum algorithms explored, we focus on gate-based models utilizing noiseless quantum simulators. Specifically, we delve into the Quantum Approximative Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE). Additionally, we investigate Quantum Annealing using the D-Wave computer. Computational experiments were conducted on fifteen small-scale instances. Given the limitations of current quantum hardware and simulators, these simplified cases provide a controlled environment to assess algorithmic performance and define the study’s scope. While the gate-based models generally require more configuration trials to yield viable solutions, the D-Wave computer consistently achieves optimal results at a faster rate. These results underscore the potential of quantum optimization in addressing challenges within reliability engineering. By integrating quantum computing into the research agenda, we can effectively navigate future advancements in this field.</div></div>","PeriodicalId":54500,"journal":{"name":"Reliability Engineering & System Safety","volume":"262 ","pages":"Article 111153"},"PeriodicalIF":9.4,"publicationDate":"2025-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143924262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic reliability and sensitivity analysis of weighted (k, r)-out-of-n cold standby system with multi-performance multi-state components","authors":"Ayush Singh, S.B. Singh","doi":"10.1016/j.ress.2025.111221","DOIUrl":"10.1016/j.ress.2025.111221","url":null,"abstract":"<div><div>The standby multi-performance multi-state (MPMS) systems represent a significant advancement in reliability engineering, incorporating the diversity of multi-states and standby configurations. Unlike traditional binary systems, which classify the states as operational or failed, standby MPMS models consider multiple performance levels and states, capturing real-world scenarios where systems can operate at reduced capacities. This paper develops a comprehensive approach based on the <span><math><msub><mi>L</mi><mi>z</mi></msub></math></span>-transform to evaluate the dynamic reliability measures of a weighted (<em>k, r</em>)-out-of-<em>n</em> cold standby system incorporating maintenance and inspection techniques that emphasize MPMS components and their dynamic interconnections. The failed components are queued under the (M|M|1):(∞|FCFS) model to undergo repair or replacement following the inspection. In case of minor, semi-minor and semi-major failures, the components are repaired according to Erlang distributions, while major failures require replacement, which follows Weibull distributions. In the considered model, standby components take over their respective places when primary components fail, ensuring the system continues operating even after component failures. The reliability measures for the system, including reliability, availability, sensitivity, instantaneous mean expected performance and cost analysis have been determined. A case study on a solar thermal power (STP) system is presented to validate the proposed methodology, illustrating its practical implementation and effectiveness.</div></div>","PeriodicalId":54500,"journal":{"name":"Reliability Engineering & System Safety","volume":"262 ","pages":"Article 111221"},"PeriodicalIF":9.4,"publicationDate":"2025-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144084579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiang Yang , Xinghua Liu , Zhengmao Li , Gaoxi Xiao , Peng Wang
{"title":"Resilience-oriented proactive operation strategy of coupled transportation power systems under exogenous and endogenous uncertainties","authors":"Xiang Yang , Xinghua Liu , Zhengmao Li , Gaoxi Xiao , Peng Wang","doi":"10.1016/j.ress.2025.111161","DOIUrl":"10.1016/j.ress.2025.111161","url":null,"abstract":"<div><div>This paper proposes a proactive resilience enhancement strategy for power systems under hurricanes, focusing on the coordinated scheduling of coupled transportation power systems (CTPS) with rail-based energy storage transportation (REST). To capture the strong uncertainties of hurricanes on CTPS, a hybrid endogenous and exogenous uncertainty set is developed. In the proposed uncertainty set, the pre-layout and trail accessibility of REST is endogenous, i.e., decision-dependent, and the operating state of transmission lines is exogenous, i.e., decision-independent. An innovative two-stage decision-dependent robust optimization (T-D<span><math><msup><mrow></mrow><mrow><mn>2</mn></mrow></msup></math></span>RO) problem is formulated to enhance the economic feasibility of the CTPS and meet load survivability requirements during hurricane. In particular, we introduce the structure of a mixed-integer programming problem with a maximum-minimum objective, ensuring post-event service protection by jointly optimizing the REST routing, load shedding, and generation curtailment in the worst-case scenario. The T-D<span><math><msup><mrow></mrow><mrow><mn>2</mn></mrow></msup></math></span>RO problem is addressed using a customized parameterized column-and-constraint generation (C&CG) algorithm, leveraging the structural characteristics of this complex problem. Numerical results for the exemplary CTPSs demonstrate that proactive deployment and adaptive routing of REST provide economically viable solutions for achieving grid resilience objectives. Moreover, the customized parameterized C&CG algorithm exhibits superior performance that reduces the computation time compared to nested C&CG, thus enabling efficient emergency response via coordinated network operations.</div></div>","PeriodicalId":54500,"journal":{"name":"Reliability Engineering & System Safety","volume":"262 ","pages":"Article 111161"},"PeriodicalIF":9.4,"publicationDate":"2025-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143924261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Changwen Wang, Guolong Ning, Qianwang Deng, Rui Liu, Qiang Luo
{"title":"Joint optimization of cooperative maintenance and inventory control for multiple k-out-of-n: F systems considering component interchange and shared spare parts","authors":"Changwen Wang, Guolong Ning, Qianwang Deng, Rui Liu, Qiang Luo","doi":"10.1016/j.ress.2025.111181","DOIUrl":"10.1016/j.ress.2025.111181","url":null,"abstract":"<div><div>In recent years, many studies have confirmed that the joint optimization of maintenance and spare parts inventory can better balance system availability and cost. However, existing research is usually limited to maintenance strategies for single system. To bridge this gap, this paper investigates the joint optimization of cooperative maintenance and spare parts inventory control for multiple identical k-out-of-n: F system composed of unrepairable components under different states. To solve this problem, under the management mode of spare sparts inventory shared, the maintenance method of component interchange between systems is proposed, and the component degradation model and multi-system joint optimization model are established. The state of the system is determined by regular inspection, and according to the states of each system and inventory level, the optimal cooperative maintenance strategy and spare parts ordering strategy are decided by Markov Decision Process (MDP) and dynamic programming theory. Finally, a numerical study on two 2-out-of-3: F systems is conducted, and the sensitivity analysis of the inspection interval length, the system downtime cost, the unit inventory holding cost and the minimum system reliability is carried out, which can prove the validity of the model and solution method.</div></div>","PeriodicalId":54500,"journal":{"name":"Reliability Engineering & System Safety","volume":"262 ","pages":"Article 111181"},"PeriodicalIF":9.4,"publicationDate":"2025-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143903587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}