Optimizing road network daily maintenance operations with stochastic service and travel times

• A new problem, the capacitated arc routing problem with stochastic service and travel times, is studied.
• A chance-constrained programming model is proposed and solved optimally by branch-and-cut algorithm.
• A stochastic programming model with recourse is proposed to take into account the recourse costs in case of route failure.
• An adaptive large neighborhood search algorithm is developed to solve the two models with large problem size.
• The results show the superiority of the stochastic programming model with recourse.

This paper studies optimization methods for a routing problem encountered in daily maintenance operations of a road network. Stochastic service and travel times on road segments are considered. The problem is formulated as a variation of the capacitated arc routing problem (CARP). A chance-constrained programming model is firstly developed and solved by a branch-and-cut algorithm. A stochastic programming model with recourse is also proposed to take into account the recourse costs in case of route failure. The problem is solved by an adaptive large neighborhood search algorithm. The computational experiments demonstrate the effectiveness of the algorithm.