Dang Viet Anh Nguyen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Dang Viet Anh Nguyen has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Aldy Gunawan
School of Computing and Information Systems, Singapore Management University, Singapore, Singapore
3 shared publications - Pieter Vansteenwegen
KU Leuven
3 shared publications - Mustafa Misir
Duke Kunshan University
2 shared publications - Bianca Pascariu
Univertsité Gustave Eiffel, COSYS‐ESTAS Villeneuve d'Ascq France
1 shared publication Carlos Lima Azevedo
Department of Technology, Management, and Economics, Technical University of Denmark (DTU), Kongens Lyngby, Denmark
1 shared publication- Carlos Lima Azevedo
Technical University of Denmark
1 shared publication
Latest Publications
- Open Access
- 16 September 2026
- Published by Springer Nature in European Transport Research Review
- Vol. 18 (1) , 85
A framework for benchmarking traffic signal control robustness under incidents: comparative study of reinforcement learning-based methods
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.
- 16 September 2026
- Published by Springer Nature in European Transport Research Review
- Vol. 18 (1) , 85
Open AccessA framework for benchmarking traffic signal control robustness under incidents: comparative study of reinforcement learning-based methods
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.
- Open Access
- 23 February 2026
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 215
Multi-Graph Inductive Representation Learning for Large-Scale Urban Rail Demand Prediction under Disruptions
- 23 February 2026
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 215
Open AccessMulti-Graph Inductive Representation Learning for Large-Scale Urban Rail Demand Prediction under Disruptions
- 4 May 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 327 (1) , 309-325
Deep reinforcement learning for solving the stochastic e-waste collection problem
- 4 May 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 327 (1) , 309-325
Deep reinforcement learning for solving the stochastic e-waste collection problem
- 1 January 2024
- Published by Springer Nature
- p. 49-64
Q-Learning Based Framework for Solving the Stochastic E-waste Collection Problem
- 1 January 2024
- Published by Springer Nature
- p. 49-64
Q-Learning Based Framework for Solving the Stochastic E-waste Collection Problem
- 7 September 2023
- Published by Springer Nature
- p. 260-275
GRASP Solution Approach for the E-Waste Collection Problem
- 7 September 2023
- Published by Springer Nature
- p. 260-275
GRASP Solution Approach for the E-Waste Collection Problem