الگوریتم های سیل آسای توسعه یافته برای بهینه سازی ناقص تعمیر و نگهداری پیشگیرانه در سیستم های چند حالته
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|22437||2008||15 صفحه PDF||سفارش دهید||8023 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Reliability Engineering & System Safety, Volume 93, Issue 11, November 2008, Pages 1658–1672
This paper deals with preventive maintenance optimization problem for multi-state systems (MSS). This problem was initially addressed and solved by Levitin and Lisnianski [Optimization of imperfect preventive maintenance for multi-state systems. Reliab Eng Syst Saf 2000;67:193–203]. It consists on finding an optimal sequence of maintenance actions which minimizes maintenance cost while providing the desired system reliability level. This paper proposes an approach which improves the results obtained by genetic algorithm (GENITOR) in Levitin and Lisnianski [Optimization of imperfect preventive maintenance for multi-state systems. Reliab Eng Syst Saf 2000;67:193–203]. The considered MSS have a range of performance levels and their reliability is defined to be the ability to meet a given demand. This reliability is evaluated by using the universal generating function technique. An optimization method based on the extended great deluge algorithm is proposed. This method has the advantage over other methods to be simple and requires less effort for its implementation. The developed algorithm is compared to than in Levitin and Lisnianski [Optimization of imperfect preventive maintenance for multi-state systems. Reliab Eng Syst Saf 2000;67:193–203] by using a reference example and two newly generated examples. This comparison shows that the extended great deluge gives the best solutions (i.e. those with minimal costs) for 8 instances among 10.
Redundancy and maintenance are methods used to improve system reliability. In the existing literature, to guarantee a given required system reliability level under cost constraint, researchers solve the problems of redundancy optimization or maintenance optimization either jointly or separately. This paper deals with preventive maintenance optimization of multi-state systems. A system is called a multi-state system (MSS) if it is capable of assuming a range of performance levels, varying from perfect functioning to complete failure. Due to their applicability in many industrial areas, the maintenance of MSS has received a growing attention in the existing literature. Gürler and Kaya  develop a maintenance policy for a multicomponent system where the lifetime assigned to each component is given by several stages. An approximate approach based on renewal theory is proposed in order to derive the long-run average cost function per unit time, which is optimized by numerical methods. In , under state-deteriorating assumption, Hsieh and Chiu develop an optimal maintenance policy for a multi-state deteriorating standby production system. A component that ensures the system to be operational deteriorates during the production process. At a given deteriorating state, this component is replaced by a standby component and sent to the maintenance service center. The optimal maintenance policy is determined by means of the number of the standby components and the optimal state where the replacement of the deteriorating components should be performed. In the work of Su and Chang , a model of MSS with state-dependent cost is considered. The state space of the system is partitioned into two subsets: the first allows to represent all states of normal operations while the second is characterized by the single failure state. A periodic maintenance model is developed and the optimal cycle time of maintenance actions is determined over a specific finite horizon. In , Lam and his coauthors consider monotone process model for a multi-state degenerative system with one working state and k failure states. More recently, in , Lam considers a one-component MSS for which the state space is characterized by k working states and l failure states. For such a system, a monotone process maintenance model is studied. Under some assumptions, it is shown that this model can be applied to multi-state deteriorating system and multi-state improving system. A replacement policy N is adopted, which is based on the failure number of the system. An analytical approach is used to determine the optimal replacement policy. In , Zhang et al. also consider a multi-state deteriorating system with k failure states and one working state. Replacement policy N is exploited and the optimal replacement time is derived to maximize the long-run average profit per time unit. In , Levitin and Lisnianski generalize the replacement schedule optimization problem to MSS. In , an MSS is given as a set of components in a series–parallel configuration. The system as well as its components are characterized by various performance levels and the system reliability is defined as the ability of the system to meet a demand. The optimal number of component replacements corresponds to that which ensure the desired level of the system reliability level by minimizing the sum of maintenance cost and the cost of unsupplied demand. A genetic algorithm is adopted as an optimization technique. Within this kind of MSS, Levitin and Lisnianski  solve the preventive maintenance optimization problem. Components of the system are characterized by their corresponding hazard function and the preventive maintenance actions may have the ability to reduce the effective age of components. A genetic algorithm is used to derive, for a given system lifetime, the optimal sequence of maintenance actions that ensure the desired system reliability level. Another existing solution technique of this problem is ant colony optimization . However, the best-published results have been provided by genetic algorithm . As MSS applicability is becoming more and more important, while requiring short development schedules and very high reliability, it is becoming increasingly important to develop efficient solutions to preventive maintenance optimization problem for MSS. By exploiting the model proposed in , to solve the imperfect preventive maintenance optimization problem for MSS, this paper presents an efficient algorithm inspired from the extended great deluge metaheuristic . This algorithm performs well and is competitive with that proposed in . This is demonstrated by the solutions found by the proposed algorithm. The remainder of this paper is organized as follows. In the next section, MSS reliability definition and estimation are presented. Section 3 addresses the preventive maintenance model. Section 4 presents the MSS model and the problem formulation. The optimization method is given in Section 5. Numerical results are presented in Section 6. Conclusion is given in Section 7.
نتیجه گیری انگلیسی
In this paper, we applied an algorithm based on the extended great deluge metaheuristic to solve the imperfect preventive maintenance problem for multi-state systems. In order to prove its efficiency, we compared the extended great deluge algorithm with the genetic algorithm . The results obtained using the extended great deluge method to solve the problem, are clearly encouraging. The main advantage of the proposed method is that it requires the setting of only one parameter that may correspond to a search time. Another important characteristic of this method is that it found the best minimal cost solutions for 8 instances among 10 (the 4 cases of Example 1 from , 1 case among 3 in Example 2 and the 2 cases of Example 3). The current study makes a comparison between the extended great deluge algorithm and the genetic algorithm which is widely proven to be very efficient in solving this problem. While the extended great deluge approach was shown to produce within an acceptable amount of time better results than genetic algorithm, future research should address the extended great deluge algorithm as compared to other heuristic techniques, such as tabu search, variable neighborhood search, GRASP and beam search, to name a few.