Skip to main content
eScholarship
Open Access Publications from the University of California

UC Berkeley

UC Berkeley Electronic Theses and Dissertations bannerUC Berkeley

Joint Optimization of Pavement Management and Reconstruction Policies for Segment and System Problems

Abstract

This dissertation presents a methodology for the joint optimization of a variety of pavement construction and management activities for segment and system problems under multiple budget constraints. The objective of pavement management is to minimize the total discounted life time costs for the agency and the highway users by finding optimal policies. The scope of the dissertation is focused on continuous time and continuous state formulations of pavement condition. We use a history-dependent pavement deterioration model to account for the influence of history on the deterioration rate.

Three topics, representing different aspects of the problem are covered in the dissertation. In the first part, the subject is the joint optimization of pavement design, maintenance and rehabilitation (M&R) strategies for the segment-level problem. A combination of analytical and numerical tools is proposed to solve the problem. In the second part of the dissertation, we present a methodology for the joint optimization of pavement maintenance, rehabilitation and reconstruction (MR&R) activities for the segment-level problem. The majority of existing Pavement Management Systems (PMS) do not optimize reconstruction jointly with maintenance and rehabilitation policies. We show that not accounting for reconstruction in maintenance and rehabilitation planning results in suboptimal policies for pavements undergoing cumulative damage in the underlying layers (base, sub-base or subgrade). We propose dynamic programming solutions using an augmented state which includes current surface condition and age. In the third part, we propose a methodology for the joint optimization of rehabilitation and reconstruction activities for heterogeneous pavement systems under multiple budget constraints. Within a bottom-up solution approach, Genetic Algorithm (GA) is adopted. The complexity of the algorithm is polynomial in the size of the system and the policy-related parameters.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View