Determination of optimal MR&R policies for retaining life-cycle connectivity of bridge networks

Xiaofei Hu, Samer Madanat

    Research output: Contribution to journalArticle

    Abstract

    Bridge management problems are computationally difficult to solve when considering network connectivity, because all bridges must be analyzed together. Past research has usually adopted simulation-based numerical methods, which are inaccurate and time-consuming. In this paper, an analytical and efficient approach is presented to determine the optimal maintenance, rehabilitation, and replacement (MR&R) plan. The objective is to ensure an adequate level of network reliability at the lowest possible life-cycle maintenance cost. Instead of considering the evolution of network reliability over the whole life cycle, the optimization is formulated with a constraint on the lower bound of network reliability, which reduces the network-level problem to one of optimizing the set of reliability levels for individual bridges. For simple decomposable networks, the network-level optimization can be tackled with standard techniques in polynomial time. For complex networks that are nondecomposable, an algorithm is provided to transform the nonlinear integer programming problem into binary integer linear programming. Finally, the framework is extended to networks with multiple origin-destination pairs. The contribution of this paper is a novel approach to solve the network connectivity problem, which makes it possible to use standard optimization tools (with guaranteed convergence to optimality), as opposed to the heuristic algorithms used in related literature.

    Original languageEnglish (US)
    Article number04014042
    JournalJournal of Infrastructure Systems
    Volume21
    Issue number2
    DOIs
    StatePublished - Jun 1 2015

    Fingerprint

    Life cycle
    Complex networks
    Integer programming
    Heuristic algorithms
    Patient rehabilitation
    Linear programming
    Numerical methods
    Polynomials
    Costs

    Keywords

    • Highway bridge
    • Maintenance management
    • Network
    • Optimization
    • Reliability

    ASJC Scopus subject areas

    • Civil and Structural Engineering

    Cite this

    Determination of optimal MR&R policies for retaining life-cycle connectivity of bridge networks. / Hu, Xiaofei; Madanat, Samer.

    In: Journal of Infrastructure Systems, Vol. 21, No. 2, 04014042, 01.06.2015.

    Research output: Contribution to journalArticle

    @article{ab0675c722324fe2958a483bad48ded0,
    title = "Determination of optimal MR&R policies for retaining life-cycle connectivity of bridge networks",
    abstract = "Bridge management problems are computationally difficult to solve when considering network connectivity, because all bridges must be analyzed together. Past research has usually adopted simulation-based numerical methods, which are inaccurate and time-consuming. In this paper, an analytical and efficient approach is presented to determine the optimal maintenance, rehabilitation, and replacement (MR&R) plan. The objective is to ensure an adequate level of network reliability at the lowest possible life-cycle maintenance cost. Instead of considering the evolution of network reliability over the whole life cycle, the optimization is formulated with a constraint on the lower bound of network reliability, which reduces the network-level problem to one of optimizing the set of reliability levels for individual bridges. For simple decomposable networks, the network-level optimization can be tackled with standard techniques in polynomial time. For complex networks that are nondecomposable, an algorithm is provided to transform the nonlinear integer programming problem into binary integer linear programming. Finally, the framework is extended to networks with multiple origin-destination pairs. The contribution of this paper is a novel approach to solve the network connectivity problem, which makes it possible to use standard optimization tools (with guaranteed convergence to optimality), as opposed to the heuristic algorithms used in related literature.",
    keywords = "Highway bridge, Maintenance management, Network, Optimization, Reliability",
    author = "Xiaofei Hu and Samer Madanat",
    year = "2015",
    month = "6",
    day = "1",
    doi = "10.1061/(ASCE)IS.1943-555X.0000226",
    language = "English (US)",
    volume = "21",
    journal = "Journal of Infrastructure Systems",
    issn = "1076-0342",
    publisher = "American Society of Civil Engineers (ASCE)",
    number = "2",

    }

    TY - JOUR

    T1 - Determination of optimal MR&R policies for retaining life-cycle connectivity of bridge networks

    AU - Hu, Xiaofei

    AU - Madanat, Samer

    PY - 2015/6/1

    Y1 - 2015/6/1

    N2 - Bridge management problems are computationally difficult to solve when considering network connectivity, because all bridges must be analyzed together. Past research has usually adopted simulation-based numerical methods, which are inaccurate and time-consuming. In this paper, an analytical and efficient approach is presented to determine the optimal maintenance, rehabilitation, and replacement (MR&R) plan. The objective is to ensure an adequate level of network reliability at the lowest possible life-cycle maintenance cost. Instead of considering the evolution of network reliability over the whole life cycle, the optimization is formulated with a constraint on the lower bound of network reliability, which reduces the network-level problem to one of optimizing the set of reliability levels for individual bridges. For simple decomposable networks, the network-level optimization can be tackled with standard techniques in polynomial time. For complex networks that are nondecomposable, an algorithm is provided to transform the nonlinear integer programming problem into binary integer linear programming. Finally, the framework is extended to networks with multiple origin-destination pairs. The contribution of this paper is a novel approach to solve the network connectivity problem, which makes it possible to use standard optimization tools (with guaranteed convergence to optimality), as opposed to the heuristic algorithms used in related literature.

    AB - Bridge management problems are computationally difficult to solve when considering network connectivity, because all bridges must be analyzed together. Past research has usually adopted simulation-based numerical methods, which are inaccurate and time-consuming. In this paper, an analytical and efficient approach is presented to determine the optimal maintenance, rehabilitation, and replacement (MR&R) plan. The objective is to ensure an adequate level of network reliability at the lowest possible life-cycle maintenance cost. Instead of considering the evolution of network reliability over the whole life cycle, the optimization is formulated with a constraint on the lower bound of network reliability, which reduces the network-level problem to one of optimizing the set of reliability levels for individual bridges. For simple decomposable networks, the network-level optimization can be tackled with standard techniques in polynomial time. For complex networks that are nondecomposable, an algorithm is provided to transform the nonlinear integer programming problem into binary integer linear programming. Finally, the framework is extended to networks with multiple origin-destination pairs. The contribution of this paper is a novel approach to solve the network connectivity problem, which makes it possible to use standard optimization tools (with guaranteed convergence to optimality), as opposed to the heuristic algorithms used in related literature.

    KW - Highway bridge

    KW - Maintenance management

    KW - Network

    KW - Optimization

    KW - Reliability

    UR - http://www.scopus.com/inward/record.url?scp=84929692887&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84929692887&partnerID=8YFLogxK

    U2 - 10.1061/(ASCE)IS.1943-555X.0000226

    DO - 10.1061/(ASCE)IS.1943-555X.0000226

    M3 - Article

    AN - SCOPUS:84929692887

    VL - 21

    JO - Journal of Infrastructure Systems

    JF - Journal of Infrastructure Systems

    SN - 1076-0342

    IS - 2

    M1 - 04014042

    ER -