Pavement Resurfacing Planning for Highway Networks: Parametric Policy Iteration Approach

This paper presents a solution approach for planning pavement resurfacing activities on highway networks in the case of continuous pavement state, discrete time, and infinite horizon. Optimal resurfacing policies that minimize discounted life-cycle costs are solved as a multi-dimensional dynamic programming problem. The framework proposed in this paper addresses decision making on both the supply and demand sides of highway networks, e.g., travelers' route choices and agency's resource allocation decisions are considered simultaneously. To reduce computational difficulty, policy iteration is used together with a parametric function approximation technique. Numerical examples are also presented.

• Corporate Authors:

  Transportation Research Board

  500 Fifth Street, NW
  Washington, DC  United States  20001
• Authors:
  • Ouyang, Yanfeng
• Conference:
  • Transportation Research Board 86th Annual Meeting
  • Location: Washington DC, United States
  • Date: 2007-1-21 to 2007-1-25
• Date: 2007

Language

• English

Media Info

• Media Type: CD-ROM
• Features: Figures; References; Tables;
• Pagination: 21p
• Monograph Title: TRB 86th Annual Meeting Compendium of Papers CD-ROM

Subject/Index Terms

• TRT Terms: Dynamic programming; Life cycle costing; Pavement design; Pavement maintenance; Pavement performance; Pavements; Resource allocation; Resurfacing; Route choice
• Uncontrolled Terms: Discrete time dynamic data; Road networks
• Subject Areas: Construction; Finance; Highways; Maintenance and Preservation; Pavements; Planning and Forecasting; I52: Construction of Pavements and Surfacings;

Filing Info

• Accession Number: 01047492
• Record Type: Publication
• Report/Paper Numbers: 07-3040
• Files: TRIS, TRB
• Created Date: May 2 2007 1:01PM