Abstract

Incorporating network configurations in bridge management problems is computationally difficult. Because of the interdependencies among bridges in a network, they have to be analyzed together. Simulation-based numerical optimization techniques adopted in past research are limited to networks of moderate sizes. In this paper, a simple framework is developed to determine optimal maintenance plans for large networks with many bridges. The objective is to minimize disruption, specifically, the extra travel distance caused by potential bridge failures over a planning horizon and under a budget constraint. It is conjectured and then verified that the expected increase in vehicle-miles traveled due to failures can be approximated by the sum of expected increases due to individual failures. This allows the network-level problem to be decomposed into single-bridge problems and tackled efficiently. The computational effort increases linearly with the number of bridges.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call