Optimizing maintenance and repair policies via a combination of genetic algorithms and Monte Carlo simulation

被引:172
作者
Marseguerra, M [1 ]
Zio, E [1 ]
机构
[1] Politecn Milan, Dept Nucl Engn, I-20133 Milan, Italy
关键词
optimization; Monte Carlo simulation; genetic algorithms; deteriorating repairs; aging; periodic maintenance; repair teams;
D O I
10.1016/S0951-8320(00)00007-7
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper we present an optimization approach based on the combination of a Genetic Algorithms maximization procedure with a Monte Carlo simulation. The approach is applied within the context of plant logistic management for what concerns the choice of maintenance and repair strategies. A stochastic model of plant operation is developed from the standpoint of its reliability/availability behavior, i.e. of the failure/repair/maintenance processes of its components. The model is evaluated by Monte Carlo simulation in terms of economic costs and revenues of operation. The flexibility of the Monte Carlo method allows us to include several practical aspects such as stand-by operation modes, deteriorating repairs, aging, sequences of periodic maintenances, number of repair teams available for different kinds of repair interventions (mechanical, electronic, hydraulic, etc.), components priority rankings. A genetic algorithm is then utilized to optimize the components maintenance periods and number of repair teams. The fitness function object of the optimization is a profit function which inherently accounts for the safety and economic performance of the plant and whose Value is computed by the above Monte Carlo simulation model. For an efficient combination of Genetic Algorithms and Monte Carlo simulation, only few hundreds Monte Carlo histories are performed for each potential solution proposed by the genetic algorithm. Statistical significance of the results of the solutions of interest (i.e. the best ones) is then attained exploiting the fact that during the population evolution the fit chromosomes appear repeatedly many times. The proposed optimization approach is applied on two case studies of increasing complexity. (C) 2000 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:69 / 83
页数:15
相关论文
共 40 条
[1]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[2]  
[Anonymous], 1983, NUREGCR3385
[3]  
Barlow RE, 1965, MATH THEORY RELIABIL
[4]  
BORGONOVA E, UNPUB MONTE CARLO ME
[5]  
BOSCH K, 1983, OR SPEKTRUM, V5, P105
[6]  
BOSCH K, 1983, OR SPEKTRUM, V5, P129
[7]   IMPERFECT REPAIR [J].
BROWN, M ;
PROSCHAN, F .
JOURNAL OF APPLIED PROBABILITY, 1983, 20 (04) :851-859
[8]  
CANTONI M, UNPUB GENETIC ALGORI
[9]  
Chambers L., 1995, PRACTICAL HDB GENETI, V1
[10]  
Chambers L.D., 1995, The Practical Handbook of Genetic Algorithms: New Frontiers, V2