This paper describes the development of a computer model (known as PAVENET-R) based on genetic algorithms, an optimization tool capable of overcoming combinatorial explosion, to solve the pavement maintenance-rehabilitation trade-off problem at the network level. The formulation of the PAVENET-R model is described in detail. An integer coding scheme is selected for parameter representation in the model. Two genetic-algorithm operators, namely the crossover operator and the mutation operator, are used. A “change table” encodes constraints to the genetic-algorithm operations to ensure that only valid offspring are generated from a parent pool. Four numerical examples of road networks of 30 pavement segments, each with different relative costs of rehabilitation and maintenance activities, are analyzed to demonstrate the trade-off relationship between pavement rehabilitation and maintenance activities. The detailed maintenance and rehabilitation schedules of the solutions, and the convergence characteristics of each solution are presented.
[1]
David E. Goldberg,et al.
Genetic Algorithms in Search Optimization and Machine Learning
,
1988
.
[2]
Tien Fang Fwa,et al.
OPTIMAL PROGRAMMING BY GENETIC ALGORITHMS FOR PAVEMENT MANAGEMENT
,
1994
.
[3]
James E. Baker,et al.
Adaptive Selection Methods for Genetic Algorithms
,
1985,
International Conference on Genetic Algorithms.
[4]
Weng Tat Chan,et al.
ROAD-MAINTENANCE PLANNING USING GENETIC ALGORITHMS. II: ANALYSIS
,
1994
.
[5]
Weng Tat Chan,et al.
Road-maintenance planning using genetic algorithms. I: Formulation
,
1994
.
[6]
Tien Fang Fwa,et al.
Highway Routine Maintenance Programming at Network Level
,
1988
.