Optimization of Long Range Major Rehabilitation of Airfield Pavements.
Abstract
The goal of this research has been to develop a methodology for managing pavement networks over prolonged analysis periods. Separate independent methods were devised for project and network level analysis, and the project level procedures were designed to provide inputs into the network level procedures. For the project level analysis, a computer code was written to use dynamic programming methods to optimally select schedule the activities (routine maintenance, reconstruction, and overlays) over the analysis period (20 years), by maximizing the structural performance (area under the utility weighted Pavement Condition Index (PCI) versus time curve). At the network level, the mathematical representation of choosing those projects that maximize the sum of the user value weighted structural performance of each project, is a zero-one integer linear programming model. Projects are selected using Toyoda's heuristic (each related to a specific feature) that maximizes the objective function with pre-established constraints (network funding limit, etc.). At several funding levels, and a series of management information reports are generated. With these reports, the consequences of selected network funding levels can quantitatively be compared. In addition, an estimate of an appropriate level of funding for the entire system can be made. The simple example shows a substantial difference between a manually developed network program and a program developed with the procedures developed in this research and an application to an existing Air Force base was presented. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1983
- Accession Number
- ADA127579
Entities
People
- David Henry Artman Jr
Organizations
- Air Force Institute of Technology