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.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multiyear Pavement Repair Scheduling Optimization by Preconstrained Genetic Algorithm


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2002-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Multiyear Pavement-Rehabilitation Planning Enabled by Geographic Information System: Network Analyses Linked to Projects

    Tsai, Yichang (James) / Gao, Bo / Lai, James | Transportation Research Record | 2004



    Optimization of Pavement Repair Construction Activities

    Sprouse, John B. / Bianchini, Alessandra | Transportation Research Record | 2020


    Pavement Repair Automation

    Smithson, L. D. / ASCE | British Library Conference Proceedings | 1993