Highway Routine Maintenance Programming at Network Level

Abstract

This paper describes a mathematical programming procedure for routine maintenance activities at the network level developed for incorporation into the existing pavement maintenance‐management system of Indiana. The procedure allows a highway agency to determine amounts of different routine maintenance activity types to be performed over a given time period under the constraints of production requirements, budget allocation, manpower, material and equipment availability, and pavement rehabilitation schedule. A priority‐weighting factor is assigned to each maintenance work so that higher‐priority work would be selected for execution. Rehabilitation constraints are included to ensure proper coordination between the selected routine maintenance activities and planned rehabilitation projects. An integer programming optimization model is developed for the proposed procedure. The types of data required and their acquisition are discussed. A numerical example based upon routine maintenance information obtained from the Indiana Department of Highways is presented as an illustration.