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

Yanfeng Ouyang and Samer Madanat

Transportation Research Part A: Policy and Practice, 2004, vol. 38, issue 5, 347-365

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.

Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0965-8564(03)00118-6
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transa:v:38:y:2004:i:5:p:347-365

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Transportation Research Part A: Policy and Practice is currently edited by John (J.M.) Rose

More articles in Transportation Research Part A: Policy and Practice from Elsevier
Bibliographic data for series maintained by Catherine Liu ().