A mathematical formulation is presented for optimal allocation of a granted budget among a system of bridges that are under the jurisdiction of a transportation agency. The formulation is based on a 0-1 integer-linear programming algorithm with multiple-choice constraints. Three improvement alternatives are assumed possible for a bridge at any point in time--replacement, rehabilitation, and major maintenance. Provision is also made for routine preventive maintenance. The optimal alternatives are selected on the basis of the criterion of maximizing reductions in equivalent uniform annual costs to the ultimate owner, the user-taxpayer. This paper appears in transportation research record no. 1268, Highway maintenance operations and research 1990.
Abstract