Stochastic maintenance for large numbers of bridges
Résumé
Maintenance of a large number of public bridges needs a statistical approach. Following [OCR], we use Markov chain degradation models with randomized maintenance strategies. Statistically, a randomized strategy represents the frequency of bridges on which a maintenance plan is implemented. We develop a Dynamic Programming approach for stationary optimal randomized strategies. In this setting, the Bellman equation becomes a functional equation, which we solve completely using the value iteration and policy iteration classical methodologies. They lead to algorithms to find the optimal solution which are used to the maintenance of a portfolio of bridges.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|