Abstract

In recent years, the maintenance of multicomponent systems has been discussed in many papers. The aim of these studies is to use the maintenance duration of one component for the maintenance of other components to minimize the total maintenance cost of the system. The complexity of the maintenance of this kind of system is due to its structure and its large number of components. The present paper suggests a grouped maintenance policy for multicomponent systems in a finite planning horizon based on the systemic inspection feedback data. The system considered is periodically inspected. Then, the collected data are triply censored (left, right, and interval censored). The proposed grouped maintenance strategy starts by clustering the components into g clusters according to their degradation model. Then, an expectation minimization algorithm is applied to correct the censorship in the data and to associate a Weibull distribution with each cluster. The proposed grouped maintenance strategy begins by specifying an individual maintenance plan for each cluster by identifying an optimal replacement path. Then, this step is followed by finding an optimal grouping strategy using a genetic algorithm. The aim is to identify a point in time when the components can be maintained simultaneously. To illustrate the proposed strategy, the grouped maintenance policy is applied to the feedback data of the road markings of French National Road 4 (NR4) connecting Paris and Strasbourg.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.