EcoRouteQ: a reinforcement learning framework for green route recommendations

IF 5.1 Q2 TRANSPORTATION
Mahdi Mohammadizadeh, Arash Mozhdehi, Xin Wang
{"title":"EcoRouteQ: a reinforcement learning framework for green route recommendations","authors":"Mahdi Mohammadizadeh,&nbsp;Arash Mozhdehi,&nbsp;Xin Wang","doi":"10.1016/j.ijtst.2025.06.001","DOIUrl":null,"url":null,"abstract":"<div><div>This paper presents EcoRouteQ, a reinforcement learning-based framework designed to address the time-dependent green route recommendation problem (TDGRRP) in urban road networks. As urban congestion and environmental concerns grow, minimizing travel time and CO<sub>2</sub> emissions has become a critical goal for sustainable transportation. TDGRRP captures this challenge by seeking optimal routing decisions that account for time-varying traffic conditions and environmental impact, making the problem inherently dynamic and multi-objective.</div><div>The framework consists of three key components. First, in the preprocessing stage, raw global positioning system (GPS) data is segmented into trips and processed using map-matching to align trajectories with the road network. This is followed by the construction of a time-dependent dataset and corresponding road network graph based on extracted travel time, speed, and CO<sub>2</sub> emission data. A graph simplification algorithm is then applied to reduce network complexity while preserving critical topology, enabling more efficient learning. Second, the framework incorporates a policy training with adaptive reward system, which includes (i) an initialization module, (ii) a policy training loop employing <em>Q</em>-learning to learn optimal multi-objective routing policies over time-dependent networks, and (iii) a reward recalibration mechanism that refines immediate rewards based on the best historical trajectories at the end of each episode. The routing task is formulated as a Markov decision process (MDP) to enable sequential decision-making under dynamic traffic conditions. Together, these components address the curse of dimensionality, mitigate slow convergence, and reduce path deviations caused by dense reward structures. Finally, the eco-route prediction module uses the trained policy models to generate personalized, multi-objective routing decisions in response to user queries, balancing travel time and CO<sub>2</sub> emissions according to user preferences.</div><div>Extensive experiments on real-world datasets from Calgary and Edmonton demonstrate that EcoRouteQ reduces travel time by up to 30.63% and 30.74%, and CO<sub>2</sub> emissions by up to 31.15% and 30.02%, respectively. On synthetic simulations, the framework consistently out-performs Dijkstra, A<sup>∗</sup> and ADRL-TSC (a reinforcement learning-based baseline), achieving travel time improvements of 41.55%, 23.73%, and 10.00%, and CO<sub>2</sub> emission reductions of 61.54%, 28.57%, and 23.08%, respectively. These results highlight EcoRouteQ’s effectiveness in reducing travel and emissions costs by jointly optimizing multiple objectives under time-dependent traffic conditions.</div></div>","PeriodicalId":52282,"journal":{"name":"International Journal of Transportation Science and Technology","volume":"23 ","pages":"Pages 36-53"},"PeriodicalIF":5.1000,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Transportation Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2046043025000784","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/6/16 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents EcoRouteQ, a reinforcement learning-based framework designed to address the time-dependent green route recommendation problem (TDGRRP) in urban road networks. As urban congestion and environmental concerns grow, minimizing travel time and CO2 emissions has become a critical goal for sustainable transportation. TDGRRP captures this challenge by seeking optimal routing decisions that account for time-varying traffic conditions and environmental impact, making the problem inherently dynamic and multi-objective.
The framework consists of three key components. First, in the preprocessing stage, raw global positioning system (GPS) data is segmented into trips and processed using map-matching to align trajectories with the road network. This is followed by the construction of a time-dependent dataset and corresponding road network graph based on extracted travel time, speed, and CO2 emission data. A graph simplification algorithm is then applied to reduce network complexity while preserving critical topology, enabling more efficient learning. Second, the framework incorporates a policy training with adaptive reward system, which includes (i) an initialization module, (ii) a policy training loop employing Q-learning to learn optimal multi-objective routing policies over time-dependent networks, and (iii) a reward recalibration mechanism that refines immediate rewards based on the best historical trajectories at the end of each episode. The routing task is formulated as a Markov decision process (MDP) to enable sequential decision-making under dynamic traffic conditions. Together, these components address the curse of dimensionality, mitigate slow convergence, and reduce path deviations caused by dense reward structures. Finally, the eco-route prediction module uses the trained policy models to generate personalized, multi-objective routing decisions in response to user queries, balancing travel time and CO2 emissions according to user preferences.
Extensive experiments on real-world datasets from Calgary and Edmonton demonstrate that EcoRouteQ reduces travel time by up to 30.63% and 30.74%, and CO2 emissions by up to 31.15% and 30.02%, respectively. On synthetic simulations, the framework consistently out-performs Dijkstra, A∗ and ADRL-TSC (a reinforcement learning-based baseline), achieving travel time improvements of 41.55%, 23.73%, and 10.00%, and CO2 emission reductions of 61.54%, 28.57%, and 23.08%, respectively. These results highlight EcoRouteQ’s effectiveness in reducing travel and emissions costs by jointly optimizing multiple objectives under time-dependent traffic conditions.
EcoRouteQ:绿色路线推荐的强化学习框架
本文提出了EcoRouteQ,一个基于强化学习的框架,旨在解决城市道路网络中随时间变化的绿色路线推荐问题(TDGRRP)。随着城市拥堵和环境问题的日益严重,减少出行时间和二氧化碳排放已成为可持续交通的关键目标。TDGRRP通过寻求考虑时变交通状况和环境影响的最佳路线决策来应对这一挑战,使问题具有内在的动态性和多目标性。该框架由三个关键组件组成。首先,在预处理阶段,原始的全球定位系统(GPS)数据被分割成行程,并使用地图匹配进行处理,使轨迹与道路网络对齐。然后,根据提取的旅行时间、速度和二氧化碳排放数据构建时间相关数据集和相应的路网图。然后应用图简化算法来降低网络复杂性,同时保留关键拓扑,从而实现更有效的学习。其次,该框架结合了具有自适应奖励系统的策略训练,其中包括(i)初始化模块,(ii)采用q -学习的策略训练循环,以在时间依赖的网络中学习最优多目标路由策略,以及(iii)奖励重新校准机制,该机制基于每一集结束时的最佳历史轨迹来优化即时奖励。将路由任务表述为马尔可夫决策过程(Markov decision process, MDP),实现动态流量条件下的顺序决策。总之,这些组件解决了维度的诅咒,缓解了缓慢的收敛,并减少了密集奖励结构引起的路径偏差。最后,生态路线预测模块使用经过训练的策略模型生成个性化的多目标路线决策,以响应用户查询,根据用户偏好平衡旅行时间和二氧化碳排放。在卡尔加里和埃德蒙顿的实际数据集上进行的大量实验表明,EcoRouteQ可分别减少高达30.63%和30.74%的出行时间,以及高达31.15%和30.02%的二氧化碳排放量。在综合模拟中,该框架始终优于Dijkstra, A∗和ADRL-TSC(一种基于强化学习的基线),行程时间分别改善41.55%,23.73%和10.00%,二氧化碳排放量分别减少61.54%,28.57%和23.08%。这些结果突出了EcoRouteQ在时间依赖性交通条件下通过联合优化多个目标来降低出行和排放成本的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Transportation Science and Technology
International Journal of Transportation Science and Technology Engineering-Civil and Structural Engineering
CiteScore
7.20
自引率
0.00%
发文量
105
审稿时长
88 days
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书