1983Transportation Research Record Journal of the Transportation Research BoardRequires access

RIGID PAVEMENT NETWORK REHABILITATION SCHEDULING

Manuel Gutierrez de Velasco, B F McCullough

Open publisher page 3 citations

Abstract

The development and application of a scheme, in the form of a computer program, to order the priority and schedule a set of rigid pavements for rehabilitation within a specified time frame and budget constraints are presented. The scheme makes use of a distress index to order the priority of a group of pavement sections and to decide when a pavement has reached its terminal condition. The distress index is calculated by combining into a single number the various distress manifestations that occur in a pavement section. The initial pavement condition is determined from field distress condition surveys and the future condition is determined by means of distress prediction models. The immediate application of the computer program is to generate lists of candidate pavements for rehabilitation; however, the use of the program can be extended to analyze the effect of several different budget policies on the condition of the pavement network.

About this research paper

What this paper is about

The development and application of a scheme, in the form of a computer program, to order the priority and schedule a set of rigid pavements for rehabilitation within a specified time frame and budget constraints are presented. The scheme makes use of a distress index to order the priority of a group of pavement sections and to decide when a pavement has reached its terminal condition. The distress index is calculated by combining into a single number the various distress manifestations that occur in a pavement section. The initial pavement condition is determined from field distress condition surveys and the future condition is determined by means of distress prediction models. The immediate application of the computer program is to generate lists of candidate pavements for rehabilitation; however, the use of the program can be extended to analyze the effect of several different budget policies on the condition of the pavement network.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The development and application of a scheme, in the form of a computer program, to order the priority and schedule a set of rigid pavements for rehabilitation within a specified time frame and budget constraints are presented. The scheme makes use of a distress index to order the priority of a group of pavement sections and to decide when a pavement has reached its terminal condition. The distress index is calculated by combining into a single number the various distress manifestations that occur in a pavement section. The initial pavement condition is determined from field distress condition surveys and the future condition is determined by means of distress prediction models. The immediate application of the computer program is to generate lists of candidate pavements for rehabilitation; however, the use of the program can be extended to analyze the effect of several different budget policies on the condition of the pavement network.

Key concepts: Schedule, Distress, Driver rehabilitation, Scheduling (production processes), Rehabilitation, Pavement management, Pavement engineering, Computer program

Related papers

Back to paper searchBrowse research topicsOriginal source
RIGID PAVEMENT NETWORK REHABILITATION SCHEDULING — Research Paper | ScholarLens