Optimal scheduling of rehabilitation activities for multiple pavement facilities: Exact and approximate solutions

Yanfeng Ouyang, Samer Madanat

Research output: Contribution to journalArticle

Abstract

This paper presents a mathematical programming model for optimal highway pavement rehabilitation planning which minimizes the life-cycle cost for a finite horizon. It extends previous researches in this area by solving the problem of multiple rehabilitation activities on multiple facilities, with realistic empirical models of deterioration and rehabilitation effectiveness. The formulation is based on discrete control theory. A nonlinear pavement performance model and integer decision variables are incorporated into a mixed-integer nonlinear programming (MINLP). Two solution approaches, a branch-and-bound algorithm and a greedy heuristic, are proposed for this model. It is shown that the heuristic results provide a good approximation to the exact optima, but with much lower computational costs.

Original languageEnglish (US)
Pages (from-to)347-365
Number of pages19
JournalTransportation Research Part A: Policy and Practice
Volume38
Issue number5
DOIs
StatePublished - Jun 2004

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Transportation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Optimal scheduling of rehabilitation activities for multiple pavement facilities: Exact and approximate solutions'. Together they form a unique fingerprint.

  • Cite this