Heuristic Based Optimisation of Pavement Management Scheduling

Loading...
Thumbnail Image
File version
Primary Supervisor
Pullan, Wayne
Chai, Wing
Other Supervisors
Editor(s)
Date
2016
Size
File type(s)
Location
License
Abstract

The issue of effectively scheduling pavement maintenance and rehabilitation treatments over a multi-year planning horizon plagues road authorities around the world with the significance of this issue being amplified by both an ageing pavement network and the trend towards insufficient fund allocation. The scope of the problem can be quantified as follows: if only a single treatment is able to be applied to each individual road segment in a single year, then the total number of possible programmed maintenance and rehabilitation schedule alternatives for a moderate-sized network of 1,000 road segments, with eight different treatments possible, over a twenty year anaysis period is ((1.0 × 103)8)20 = 1.0 × 10480. Assuming that a computer can build and evaluate 100 complete maintenance and rehabilitation schedules a second, to identify the optimal schedule for this 1,000 segment road network would take 3.17 × 10471 years. The overall goal of this study is to investigate the benefits of applying modern heuristic optimisation techniques to the problem of pavement main- tenance and rehabilitation scheduling over a multi-year planning horizon. To address this goal, a four stage approach was utilised using a real road network with real pavement condition data as the test benchmark.

Journal Title
Conference Title
Book Title
Edition
Volume
Issue
Thesis Type
Thesis (PhD Doctorate)
Degree Program
Doctor of Philosophy (PhD)
School
Griffith School of Engineering
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
The author owns the copyright in this thesis, unless stated otherwise.
Rights Statement
Item Access Status
Public
Note
Access the data
Related item(s)
Subject
Pavement maintenance
Road maintenance
Persistent link to this record
Citation