Road maintenance optimization through a discrete-time semi-Markov decision process

https://doi.org/10.1016/j.ress.2012.03.011Get rights and content

Abstract

Optimization models are necessary for efficient and cost-effective maintenance of a road network. In this regard, road deterioration is commonly modeled as a discrete-time Markov process such that an optimal maintenance policy can be obtained based on the Markov decision process, or as a renewal process such that an optimal maintenance policy can be obtained based on the renewal theory. However, the discrete-time Markov process cannot capture the real time at which the state transits while the renewal process considers only one state and one maintenance action. In this paper, road deterioration is modeled as a semi-Markov process in which the state transition has the Markov property and the holding time in each state is assumed to follow a discrete Weibull distribution. Based on this semi-Markov process, linear programming models are formulated for both infinite and finite planning horizons in order to derive optimal maintenance policies to minimize the life-cycle cost of a road network. A hypothetical road network is used to illustrate the application of the proposed optimization models. The results indicate that these linear programming models are practical for the maintenance of a road network having a large number of road segments and that they are convenient to incorporate various constraints on the decision process, for example, performance requirements and available budgets. Although the optimal maintenance policies obtained for the road network are randomized stationary policies, the extent of this randomness in decision making is limited. The maintenance actions are deterministic for most states and the randomness in selecting actions occurs only for a few states.

Introduction

It is important for a road agency to efficiently and cost-effectively maintain a road network under its jurisdiction at the required performance levels over the service life. In this regard, there is a need to develop a long-term maintenance optimization model to minimize the life-cycle costs of the road network based on the reasonable modeling of the life-cycle road deterioration. In this paper, we model the life-cycle deterioration of different road segments in the road network as a semi-Markov process and develop linear programming (LP) optimization models to minimize the life-cycle costs of the road network based on the semi-Markov decision process (SMDP). The deterioration model is proposed on the basis of the initial inputs of the deterioration process at the beginning of the planning horizon and will be continuously tested given the regular inspection data. If it is found from the real inspection data that the real deterioration process is quite different from the initial input deterioration process, the deterioration model needs to be updated and the optimization model needs to be recalculated according to the updated deterioration model.

In this paper, the road performance measured by road roughness is divided into discrete performance states. To model the road deterioration as a semi-Markov process, the holding time in each state is assumed to follow a discrete Weibull distribution [1], which is widely used in modeling the life-time of road and other infrastructure assets [2], [3], [4]. Four maintenance actions are standardized for all performance states. The transition probabilities are calculated in terms of the holding time in each state. LP optimization models are developed to minimize the expected average costs over an infinite planning horizon and a finite planning horizon, respectively. The reasons of applying LP optimization models are that they are practical for the maintenance of a road network having a large number of road segments and that they are convenient to incorporate various constraints (e.g. performance requirements and available budgets) on the decision process [5].

Without the loss of generality, we develop a hypothetical road network to illustrate the application of the proposed optimization models. The optimal maintenance policy obtained for the road network is a randomized stationary policy [6], i.e., it specifies a probability on selecting a maintenance action when a road segment stays in a particular state. However, the scope of randomness in decision making is usually limited, i.e., the maintenance actions are deterministic for most states and the randomness in selecting actions occurs only for a few states. Therefore, the optimal maintenance policy obtained is practical in the maintenance operation of a road network.

Section snippets

Literature review

Road maintenance optimization is a planning problem based on Operational Research methods [7] and the prediction of road life-cycle deterioration can be modeled by stochastic processes [8]. Commonly, the deterioration of a road segment can be modeled as a discrete-time Markov process such that an optimal maintenance policy can be obtained based on the Markov decision process [9], [10], [11]. A Markov process is a stochastic process in which the state at a future time point only depends on its

Roughness as a road performance measure

The performance of a road segment can be measured by structural condition and service condition. Roughness is a measure of road surface distortion that reflects the ability of the road to provide a comfortable ride to users [24]. Roughness is primarily associated with serviceability; however, it is also related to structural deficiencies and accelerated road deterioration. Roughness has a significant effect on vehicle operating costs, safety, comfort, and speed of travel, and therefore it is a

Preliminary of a discrete-time semi-Markov process

For a finite state space S={S1,S2,...,Sm}, a finite action set A={a1,a2,...,al}, and discrete time points 0, 1, …, t, (t+1), …, a one-step transition probability in a discrete-time Markov process is expressed as follows:P(1)(j|i,a)=Pr(St+1=j|St=i,At=a)i,jS,aA,t=0,1,where P(1)(j|i,a)=the probability that the next state is in j at time point (t+1) given that the current state is in i and that action a is taken at time point t. The one-step transition probability is independent of the current

Planning horizon, decision epoch and decision period

The planning horizon in the maintenance of a road network is the whole length of time for which an optimal maintenance policy is derived and implemented. The decision epoch is a time point at which a decision is made on which maintenance action to take. The decision period is the time interval between two successive decision epochs.

State space

As discussed previously, the performance of a road segment is measured by the RQI, which is derived from the IRI. Here, S, the state space of the performance of a

Parameters of discrete Weibull distribution

The parameters of the discrete Weibull distribution for road deterioration can be determined by the maximum-likelihood estimation method if there are sufficient observation data of the lifetimes of road segments in each state. If historical observation data are insufficient, expert opinions can be solicited to derive these parameters. A group of experts can be invited to answer questions pertaining to their beliefs about the likelihood of a road segment remaining in a given state for a certain

Objective function

The infinite-time LP model seeks an optimal randomized stationary policy that minimizes the expected average maintenance cost of the road network over an infinite time horizon:MinLRiSaAc(i,a)π(i,a)iSaAE[τ(i,a)]π(i,a)where c(i, a)=the average unit maintenance cost associated with state–action pair (i, a) for a road segment; π(i, a)=the steady-state road segment distribution of state–action pair (i, a), iSaAπ(i,a)=1; E[τ(i,a)]=the expected holding time of state–action pair (i, a); LR

Optimal maintenance policy

By solving the infinite-time and finite-time LP models, λ(i, a), the steady-state intensity of each state–action pair in an infinite planning horizon, and πn(i, a), the road segment distribution at time point tn for each state–action pair in a finite planning horizon, can be obtained. In some cases, for a state i, λ(i, a) or πn(i, a) may be nonzero for two or more maintenance actions. This means that the decision maker needs to randomly choose maintenance actions for a fraction of the road

Illustrative example

Real road performance data currently are not available to verify the optimization models proposed in this paper. In this section, a hypothetical road network is used to illustrate the application of the proposed optimization models. There are 100 road segments in the network. The length of each segment is 1 km. The total length of the road network is 100 km. The planning horizon of the finite-time LP model is 20 years.

Limitation and methodology for future improvement

The main limitation of this study is that there are no real data available to test the proposed optimization models and to verify some assumptions associated with these models. In particular, the real distribution of the holding time in each state cannot be derived from statistical analysis methods (e.g., regression analysis [31]) without real data. The use of a discrete Weibull distribution in this paper may not precisely represent the real road deterioration process although it is widely used

Conclusions

The maintenance of a road network is a complicated issue that requires efficient and practical optimization models. In this paper, both infinite and finite time LP models have been developed based on the semi-Markov decision process. The infinite-time LP model seeks an optimal randomized stationary policy that minimizes the expected average maintenance cost of the road network over an infinite time horizon. The objective of the finite-time LP model is to minimize the average maintenance cost of

Acknowledgment

This study is sponsored by the Public Policy Research Grant HKUST6004-PPR-10 of the Hong Kong Research Grant Council.

References (34)

  • Y. Li et al.

    A steady-state solution for the optimal pavement resurfacing problem

    Transportation Research Part A

    (2002)
  • T. Nakagawa et al.

    The discrete Weibull distribution

    IEEE Transactions on Reliability

    (1975)
  • Y. Kleiner

    Scheduling inspection and renewal of large infrastructure assets

    Journal of Infrastructure System

    (2001)
  • X. Zhang et al.

    Optimal performance-based building facility management

    Computer-Aided Civil and Infrastructure Engineering

    (2010)
  • M.L. Puterman

    Markov decision processes: discrete stochastic dynamic programming

    (2005)
  • N.D. Singpurwalla

    Survival in dynamic environments

    Statistical Science

    (1995)
  • K. Golabi et al.

    A statewide pavement management system

    Interfaces

    (1982)
  • Cited by (47)

    • Multi-year planning for optimal navigation channel dredging and dredged material management

      2022, Transportation Research Part E: Logistics and Transportation Review
      Citation Excerpt :

      Planning of maritime navigation channel dredging and roadway maintenance on network level have similar features and considerations, including infrastructure condition deterioration, maintenance cost subject to a budget, economic value of each road segment, asset bundling for easier management, etc. Plenty of research has proposed advanced methodologies for roadway maintenance planning problems, such as mathematical programming (e.g., mixed integer programming), dynamic programming, Markov chain, and heuristic algorithms (e.g., prioritization and meta-heuristic algorithms) (Golabi et al., 1982; Morcous and Lounis, 2005; Zhang and Gao, 2012; Gao and Zhang, 2013; Binhomaid and Hegazy, 2014; Ma et al., 2018). However, these methodologies cannot be directly applied in maritime channel maintenance planning problem that is studied in this paper.

    View all citing articles on Scopus
    View full text