分析网络拓扑结构在估计平均每日交通流量中的重要性:利用图神经网络从旅行需求模型中获得的启示

IF 3.5 2区 工程技术 Q1 ENGINEERING, CIVIL
Hao Zhen, Jidong J. Yang
{"title":"分析网络拓扑结构在估计平均每日交通流量中的重要性:利用图神经网络从旅行需求模型中获得的启示","authors":"Hao Zhen, Jidong J. Yang","doi":"10.1007/s11116-024-10536-y","DOIUrl":null,"url":null,"abstract":"<p>Metropolitan traffic networks are becoming increasingly complex due to the growing population and diverse range of travel modes. However, the limited installation of continuous count stations leads to partially observable networks, posing a significant challenge for effective highway planning and design practices at various scales. Travel demand models have been developed and calibrated using sparse traffic counts at the metropolitan level. Nevertheless, these models are cumbersome to recalibrate and rerun whenever network changes occur. To overcome this challenge, we propose a flexible learning-based approach that extracts embedded knowledge from large-scale activity-based travel demand models to estimate Annual Average Daily Traffic (AADT). The approach offers two primary advantages: (1) directly learning network flow patterns based on segment attributes and network topology that can be transferred across regions, and (2) enabling efficient and reliable AADT estimation for projects of various scales. Our study explores a wide range of machine learning techniques, including novel graph neural networks that explicitly account for network topology, as well as modern and traditional regression and regression kriging models, which either disregard or implicitly consider network topology. We conducted extensive experiments using the loaded network data from the activity-based travel demand model for the Atlanta metropolitan area. Our findings underscore the importance of network topology in AADT estimation, with the diffusion graph convolutional network model demonstrating the best performance in both transductive and inductive settings. Additionally, modern tree ensemble models such as random forest regressor and CatBoost, despite their ignorance of network topology, show the second-best inductive performance with relatively lightweight structures.</p>","PeriodicalId":49419,"journal":{"name":"Transportation","volume":"16 1","pages":""},"PeriodicalIF":3.5000,"publicationDate":"2024-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analyzing the importance of network topology in AADT estimation: insights from travel demand models using graph neural networks\",\"authors\":\"Hao Zhen, Jidong J. Yang\",\"doi\":\"10.1007/s11116-024-10536-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Metropolitan traffic networks are becoming increasingly complex due to the growing population and diverse range of travel modes. However, the limited installation of continuous count stations leads to partially observable networks, posing a significant challenge for effective highway planning and design practices at various scales. Travel demand models have been developed and calibrated using sparse traffic counts at the metropolitan level. Nevertheless, these models are cumbersome to recalibrate and rerun whenever network changes occur. To overcome this challenge, we propose a flexible learning-based approach that extracts embedded knowledge from large-scale activity-based travel demand models to estimate Annual Average Daily Traffic (AADT). The approach offers two primary advantages: (1) directly learning network flow patterns based on segment attributes and network topology that can be transferred across regions, and (2) enabling efficient and reliable AADT estimation for projects of various scales. Our study explores a wide range of machine learning techniques, including novel graph neural networks that explicitly account for network topology, as well as modern and traditional regression and regression kriging models, which either disregard or implicitly consider network topology. We conducted extensive experiments using the loaded network data from the activity-based travel demand model for the Atlanta metropolitan area. Our findings underscore the importance of network topology in AADT estimation, with the diffusion graph convolutional network model demonstrating the best performance in both transductive and inductive settings. Additionally, modern tree ensemble models such as random forest regressor and CatBoost, despite their ignorance of network topology, show the second-best inductive performance with relatively lightweight structures.</p>\",\"PeriodicalId\":49419,\"journal\":{\"name\":\"Transportation\",\"volume\":\"16 1\",\"pages\":\"\"},\"PeriodicalIF\":3.5000,\"publicationDate\":\"2024-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1007/s11116-024-10536-y\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, CIVIL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s11116-024-10536-y","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, CIVIL","Score":null,"Total":0}
引用次数: 0

摘要

由于人口增长和出行方式的多样化,大都市的交通网络正变得日益复杂。然而,由于连续计数站的安装数量有限,导致只能部分观测交通网络,这给各种规模的有效公路规划和设计实践带来了巨大挑战。目前已开发出旅行需求模型,并利用大都市一级的稀疏交通流量计数进行了校准。然而,每当网络发生变化时,重新校准和运行这些模型都非常麻烦。为克服这一难题,我们提出了一种基于学习的灵活方法,该方法可从基于活动的大规模出行需求模型中提取内含知识,以估算年平均日交通流量(AADT)。该方法有两个主要优势:(1)基于区段属性和网络拓扑结构直接学习网络流量模式,并可跨区域传输;(2)可为各种规模的项目提供高效可靠的 AADT 估算。我们的研究探索了多种机器学习技术,包括明确考虑网络拓扑结构的新型图神经网络,以及现代和传统的回归和回归克里金模型,这些模型或忽略或隐含地考虑了网络拓扑结构。我们使用亚特兰大大都会地区基于活动的旅行需求模型中的加载网络数据进行了大量实验。我们的研究结果表明了网络拓扑结构在 AADT 估算中的重要性,其中扩散图卷积网络模型在转导和归纳设置中都表现出了最佳性能。此外,随机森林回归模型和 CatBoost 等现代树状集合模型尽管不了解网络拓扑结构,但却以相对轻量级的结构显示出第二好的归纳性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Analyzing the importance of network topology in AADT estimation: insights from travel demand models using graph neural networks

Analyzing the importance of network topology in AADT estimation: insights from travel demand models using graph neural networks

Metropolitan traffic networks are becoming increasingly complex due to the growing population and diverse range of travel modes. However, the limited installation of continuous count stations leads to partially observable networks, posing a significant challenge for effective highway planning and design practices at various scales. Travel demand models have been developed and calibrated using sparse traffic counts at the metropolitan level. Nevertheless, these models are cumbersome to recalibrate and rerun whenever network changes occur. To overcome this challenge, we propose a flexible learning-based approach that extracts embedded knowledge from large-scale activity-based travel demand models to estimate Annual Average Daily Traffic (AADT). The approach offers two primary advantages: (1) directly learning network flow patterns based on segment attributes and network topology that can be transferred across regions, and (2) enabling efficient and reliable AADT estimation for projects of various scales. Our study explores a wide range of machine learning techniques, including novel graph neural networks that explicitly account for network topology, as well as modern and traditional regression and regression kriging models, which either disregard or implicitly consider network topology. We conducted extensive experiments using the loaded network data from the activity-based travel demand model for the Atlanta metropolitan area. Our findings underscore the importance of network topology in AADT estimation, with the diffusion graph convolutional network model demonstrating the best performance in both transductive and inductive settings. Additionally, modern tree ensemble models such as random forest regressor and CatBoost, despite their ignorance of network topology, show the second-best inductive performance with relatively lightweight structures.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Transportation
Transportation 工程技术-工程:土木
CiteScore
10.70
自引率
4.70%
发文量
94
审稿时长
6-12 weeks
期刊介绍: In our first issue, published in 1972, we explained that this Journal is intended to promote the free and vigorous exchange of ideas and experience among the worldwide community actively concerned with transportation policy, planning and practice. That continues to be our mission, with a clear focus on topics concerned with research and practice in transportation policy and planning, around the world. These four words, policy and planning, research and practice are our key words. While we have a particular focus on transportation policy analysis and travel behaviour in the context of ground transportation, we willingly consider all good quality papers that are highly relevant to transportation policy, planning and practice with a clear focus on innovation, on extending the international pool of knowledge and understanding. Our interest is not only with transportation policies - and systems and services – but also with their social, economic and environmental impacts, However, papers about the application of established procedures to, or the development of plans or policies for, specific locations are unlikely to prove acceptable unless they report experience which will be of real benefit those working elsewhere. Papers concerned with the engineering, safety and operational management of transportation systems are outside our scope.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信