eess.SYAug 14, 2026

Optimal Scheduling of Road Maintenance Jobs Considering Impact on Traffic Flows

Authors: Charitha Nandepu, Lohitha Kalepu, Gabriele Ciavarella, SangWoo Park

Abstract

Network-level maintenance planning requires repeated evaluations of equilibrium traffic flows under road capacity reductions. While equilibrium traffic assignment models are well established, their repeated solution quickly becomes computationally prohibitive and challenging to embed within maintenance scheduling problems. This paper investigates data-driven surrogate models that approximate equilibrium arc flows directly from origin-destination demand, using optimization-based equilibrium solutions as ground truth. A real-world case study based on traffic data from the Newark, New Jersey area demonstrates the effectiveness of the proposed approach as a scalable building block for future maintenance scheduling frameworks.

Figures & tables

Explore similar work

Jun 22, 2026

Simulation-Free Estimation of Traffic Flows from Sparse Count Data

We propose a method for estimating time-varying traffic flow patterns from sparse aggregated vehicle counts. The method partitions the study area into spatial regions, constructs a set of feasible region-to-region routes, and solves a weighted least-squares optimization problem to determine the number of vehicles to allocate on each route. A weighted contribution matrix encodes sensor coverage, steering the optimizer toward flow configurations that are directly observable by sensors. Edge-level trajectories are then derived by scoring candidate routes against the temporal and volumetric profiles of aggregated regional sensor counts. The method is evaluated on the Brussels road network using real and synthetic traffic data. Results show that the proposed approach reproduces the daily traffic profile in the input data and outperforms the baseline methods at a fraction of the computational cost.
Mar 6, 2026

Metalearning traffic assignment for network disruptions with graph convolutional neural networks

Building machine-learning models for estimating traffic flows from OD matrices requires an appropriate design of the training process and a training dataset spanning over multiple regimes and dynamics. As machine-learning models rely heavily on historical data, their predictions are typically accurate only when future traffic patterns resemble those observed during training. However, their performance often degrades when there is a significant statistical discrepancy between historical and future conditions. This issue is particularly relevant in traffic forecasting when predictions are required for modified versions of the network, where the underlying graph structure changes due to events such as maintenance, public demonstrations, flooding, or other extreme disruptions. Ironically, these are precisely the situations in which reliable traffic predictions are most needed. In the presented work, we combine a machine-learning model (graph convolutional neural network) with a meta-learning architecture to train the former to quickly adapt to new graph structures and demand patterns, so that it may easily be applied to scenarios in which changes in the road network (the graph) and the demand (the node features) happen simultaneously. Our results show that the use of meta-learning allows the graph neural network to quickly adapt to unseen graphs (network closures) and OD matrixes while easing the burden of designing a training dataset that covers all relevant patterns for the practitioners. The proposed architecture achieves a R^2 of around 0.85 over unseen closures and OD matrixes.
Feb 25, 2026

Learning from Yesterday's Error: An Efficient Online Learning Method for Traffic Demand Prediction

Accurately predicting short-term traffic demand is critical for intelligent transportation systems. While deep learning models achieve strong performance under stationary conditions, their accuracy often degrades significantly when faced with distribution shifts caused by external events or evolving urban dynamics. Frequent model retraining to adapt to such changes incurs prohibitive computational costs, especially for large-scale or foundation models. To address this challenge, we propose FORESEE (Forecasting Online with Residual Smoothing and Ensemble Experts), a lightweight online adaptation framework that is accurate, robust, and computationally efficient. FORESEE operates without any parameter updates to the base model. Instead, it corrects today's forecast in each region using yesterday's prediction error, stabilized through exponential smoothing guided by a mixture-of-experts mechanism that adapts to recent error dynamics. Moreover, an adaptive spatiotemporal smoothing component propagates error signals across neighboring regions and time slots, capturing coherent shifts in demand patterns. Extensive experiments on seven real-world datasets with three backbone models demonstrate that FORESEE consistently improves prediction accuracy, maintains robustness even when distribution shifts are minimal (avoiding performance degradation), and achieves the lowest computational overhead among existing online methods. By enabling real-time adaptation of traffic forecasting models with negligible computational cost, FORESEE paves the way for deploying reliable, up-to-date prediction systems in dynamic urban environments. Code and data are available at https://github.com/xiannanhuang/FORESEE