Dynamic programming for optimal bridge maintenance planning

摘要

This paper presents a dynamic programming procedure for identifying the optimalrnbridge maintenance plans that have the minimum life-cycle maintenance costs, while satisfyingrnboth safety and condition requirements for a targeted service lifetime. The proposed procedurernis integrated with Monte Carlo simulations to find the probability distributions of the times atrnwhich each maintenance action candidate may be applied during the entire life of a bridge. Therncorresponding computer program, called BMS-DP, along with a numerical example are brieflyrnpresented in this paper.