OPTIMAL PAVEMENT MAINTENANCE PROGRAMS BASED ON A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE ALGORITHM

Abstract

Insufficient investment in the public sector together with inefficient maintenance infrastructure programs lead to high economic costs in the long term. Thus, infrastructure managers need practical tools to maximize the Long-Term Effectiveness (LTE) of maintenance programs. This paper describes an optimization tool based on a hybrid Greedy Randomized Adaptive Search Procedure (GRASP) considering Threshold Accepting (TA) with relaxed constraints. This tool facilitates the design of optimal maintenance programs subject to budgetary and technical restrictions, exploring the effect of different budgetary scenarios on the overall network condition. The optimization tool is applied to a case study demonstrating its efficiency to ana­lyze real data. Optimized maintenance programs are shown to yield LTE 40% higher than the traditional programs based on a reactive strategy. To extend the results obtained in this case study, a set of simulated scenarios, based on the range of values found in the real example, are also optimized. This analysis concludes that this optimization algorithm enhances the allocation of maintenance funds over the one obtained under a traditional reactive strategy. The sensitivity analysis of a range of budgetary scenarios indicates that the funding level in the early years is a driving factor of the LTE of optimal maintenance programs.