Multiyear pavement repair scheduling optimization by preconstrained genetic algorithm.

Author(s)
Tack, J.N. & Chou, E.Y.J.
Year
Abstract

Development of a genetic algorithm (GA)-based optimization tool for determining the optimal multiyear pavement repair schedule is described. The problem of finding the best multiyear work plan can be modeled as a combinatorial optimization problem, the objective of which is to achieve the highest possible average network condition for a given budget and operating constraints. Two GAs and a dynamic programming (DP) approach were implemented to determine multiyear repair schedules. The DP method resulted in optimal solutions, but it suffers from rigidity and inability to handle large-scale problems. The GA techniques obtained solutions that were near optimal and maintained flexibility and scalability. The GAs implemented were of two types: simple and preconstrained. The simple GA uses constraints when searching for solutions. The preconstrained GA uses constraints that limit which repair can be selected before searching for solutions to attain better efficiency.

Request publication

5 + 6 =
Solve this simple math problem and enter the result. E.g. for 1+3, enter 4.

Publication

Library number
C 29988 (In: C 29987 S [electronic version only]) /60 /23 / ITRD E822859
Source

In: Pavement management, monitoring, and accelerated testing 2002 : pavement design, management, and performance, Transportation Research Record TRR 1816, p. 3-9, 25 ref.

Our collection

This publication is one of our other publications, and part of our extensive collection of road safety literature, that also includes the SWOV publications.