arXiv subjects

Dang Viet Anh Nguyen

Publications and source records attributed to Dang Viet Anh Nguyen.

4 recordsLinked to original sources

arXiv2026

Hierarchical Forecast Reconciliation for Urban Rail Transit Demand Prediction under Operational Disruptions

Accurate and coherent passenger demand forecasting is essential for Urban Rail Transit (URT) operations. Passenger demand is hierarchical: origin--destination (OD) flows aggregate to station-level inflows and outflows through conservation constraints. However, independently generated station- and OD-level forecasts may violate these constraints and limit information sharing across levels. This paper develops a hierarchical forecast reconciliation framework for joint station- and OD-level demand prediction. A neural Fully Connected Reconciler (FCR) maps incoherent base forecasts to coherent predictions with exact structural consistency by construction. We benchmark FCR against classical and machine-learning reconciliation methods using one year of Rejsekort smart-card and Banedanmark operational data from a 12-station Copenhagen S-train subnetwork, covering one-step, multi-step, and disruption forecasting. We also compare against a matched-parameter multi-task station--OD baseline with a soft consistency penalty. Reconciliation improves aggregate OD accuracy while enforcing exact coherence. Under standard conditions, FCR is competitive with statistical methods, while an oracle experiment using observed station demand reduces OD MSE by about 34\%. Under train delays and cancellations, reconciliation continues to improve OD accuracy, with FCR achieving larger reductions than MinT-Sample in disruption-affected subsets. Greater cross-level disagreement is associated with larger reconciliation gains, highlighting the value of hierarchical reconciliation under both regular and disrupted operations.

cs.LG↗

arXiv2026

A Two-Echelon Covering Tour Vehicle Routing Problem with Drones for Post-Disaster Relief

We introduce the two-echelon covering tour vehicle routing problem (2E-CTVRP) for the distribution of relief supplies after a disaster. In the first echelon, a fleet of trucks transports supplies and drones from a central depot to satellites at the periphery of the affected area. In the second echelon, drones launched in parallel from the satellites deliver the supplies to the centroids of victim clusters, which are obtained by clustering the victim locations, and each truck waits at a satellite until its drones have returned. The problem combines the assignment of satellites to trucks, the sequencing of the truck routes, and the assignment of clusters to satellites, and minimizes the sum of the arrival times of the trucks at the satellites and at the depot. We formulate the 2E-CTVRP as a mixed integer linear program and propose a hybrid metaheuristic, GRASP-ILS-PR, which combines greedy randomized construction, a single-trajectory search, and periodic path relinking on the assignment of clusters to satellites. On a new benchmark set of 110 instances, GRASP-ILS-PR finds all known optimal solutions within 30 seconds, matches or improves on the one-hour solutions of a commercial solver on most larger instances, and improves on them by up to 11% for instances with 50 satellites. It clearly outperforms a conventional GRASP with evolutionary path relinking and yields more consistent results than a simulated annealing algorithm that uses the same search components. An analysis of two fleet configurations shows that few large trucks minimize the cumulative arrival time in most instances, whereas many small trucks deliver supplies to the victims earlier and more equitably in every instance.

cs.RO↗

arXiv2025

Robustness of Reinforcement Learning-Based Traffic Signal Control under Incidents: A Comparative Study

Reinforcement learning-based traffic signal control (RL-TSC) has emerged as a promising approach for improving urban mobility. However, its robustness under real-world disruptions such as traffic incidents remains largely underexplored. In this study, we introduce T-REX, an open-source, SUMO-based simulation framework for training and evaluating RL-TSC methods under dynamic, incident scenarios. T-REX models realistic network-level performance considering drivers' probabilistic rerouting, speed adaptation, and contextual lane-changing, enabling the simulation of congestion propagation under incidents. To assess robustness, we propose a suite of metrics that extend beyond conventional traffic efficiency measures. Through extensive experiments across synthetic and real-world networks, we showcase T-REX for the evaluation of several state-of-the-art RL-TSC methods under multiple real-world deployment paradigms. Our findings show that while independent value-based and decentralized pressure-based methods offer fast convergence and generalization in stable traffic conditions and homogeneous networks, their performance degrades sharply under incident-driven distribution shifts. In contrast, hierarchical coordination methods tend to offer more stable and adaptable performance in large-scale, irregular networks, benefiting from their structured decision-making architecture. However, this comes with the trade-off of slower convergence and higher training complexity. These findings highlight the need for robustness-aware design and evaluation in RL-TSC research. T-REX contributes to this effort by providing an open, standardized and reproducible platform for benchmarking RL methods under dynamic and disruptive traffic scenarios.

cs.LG↗

arXiv2025

Multi-Graph Inductive Representation Learning for Large-Scale Urban Rail Demand Prediction under Disruptions

With the expansion of cities over time, URT (Urban Rail Transit) networks have also grown significantly. Demand prediction plays an important role in supporting planning, scheduling, fleet management, and other operational decisions. In this study, we propose an Origin-Destination (OD) demand prediction model called Multi-Graph Inductive Representation Learning (mGraphSAGE) for large-scale URT networks under operational uncertainties. Our main contributions are twofold: we enhance prediction results while ensuring scalability for large networks by relying simultaneously on multiple graphs, where each OD pair is a node on a graph and distinct OD relationships, such as temporal and spatial correlations; we show the importance of including operational uncertainties such as train delays and cancellations as inputs in demand prediction for daily operations. The model is validated on three different scales of the URT network in Copenhagen, Denmark. Experimental results show that by leveraging information from neighboring ODs and learning node representations via sampling and aggregation, mGraphSAGE is particularly suitable for OD demand prediction in large-scale URT networks, outperforming reference machine learning methods. Furthermore, during periods with train cancellations and delays, the performance gap between mGraphSAGE and other methods improves compared to normal operating conditions, demonstrating its ability to leverage system reliability information for predicting OD demand under uncertainty.

cs.LG↗